To solve leakages as complex subdivision structures, high nodes overlap probability and poorsupporting on multi-dimensional entity object retrievals and the computation of existing spatial indexes. This paperpresents a boundary restricted non-overlapping sphere tree for a unified multidimensional solid object index. Byusing the outer product expression of a sphere in Geometric Algebra, an approach is explored for intersectionjudgments and point extractions between lines and planes and lines and spherical surfaces based on meet operators.The element subdivision of multi-dimensional object voxelization and the boundary restricted non-overlappingsphere-filling algorithm is developed to balance the conditions (e.g. granularity, non-overlapping subdivision ofobject voxelization), the duplication and approximate degrees of approaching objects. Furthermore, generating andupdating minimum boundary sphere and batch Neural Gas hierarchical clustering algorithm is also presented, andcontains a volume adjusted, index level system steady with the balance of each branch of a sphere tree. Next, withthe advantage of a clear geometric meaning, simple geometric relations calculation among spheres and dynamicalupdateable parameters, index structure can be dynamically generated and updated. Finally, the unifiedmultidimensional solid object index, a query mechanism of any location and range on and in the solid objects isproposed. The updated minimum boundary sphere construction, algorithm, and the volume adjusted adaptive batchNeural Gas hierarchical cluster algorithm are defined to quickly, robustly, relatively, and uniformly classify thefilling sphere. The simulation of different physical objects and performance comparison with a commonly usedsphere tree indexes suggest that the proposed index can effectively query any position or regions on and in the solidobjects, and support the nearest linkage distance and dynamical overlapping query under limited time restrictionswith high precision.