On levels of detail in terrains
Proceedings of the eleventh annual symposium on Computational geometry
Hierarchical triangulation for multiresolution surface description
ACM Transactions on Graphics (TOG)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
The variance quadtree algorithm: Use for spatial sampling design
Computers & Geosciences
| Hi-index | 0.00 |
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.