Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
