Multidimensional binary indexing for neighbourhood calculations in spatial partition trees

We present a binary array encoding (location arrays) of the nodes in a spatial partition tree representing spaces of dimension k. This framework facilitates tree traversal for optimizing access speed, and also supports simplified calculation of the neighbourhood of a subinterval of a particular partition. After defining the encoding we present a neighbour determination algorithm which extends work carried out by Samet, Goodchild and others on quadtrees, of particular interest when managing large data volumes during real-time terrain flyovers. The primary extension is that the encoding and the neighbour determination algorithm extend to arbitrary dimensions beyond the 2-d quadtree case.