A consistent hierarchical representation for vector data
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Storing a collection of polygons using quadtrees
ACM Transactions on Graphics (TOG)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Communications of the ACM
A qualitative comparison study of data structures for large line segment databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Separability of polyhedra for optimal filtering of spatial and constraint data
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Speeding up bulk-loading of quadtrees
GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
Improved bulk-loading algorithms for quadtrees
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Model-Based Recognition of 3D Objects from Single Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data
Journal of Automated Reasoning
Energy-performance trade-offs for spatial access methods on memory-resident data
The VLDB Journal — The International Journal on Very Large Data Bases
Approximate average storage utilization of bucket methods with arbitrary fanout
Nordic Journal of Computing
Benchmarking Spatial Join Operations with Spatial Output
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Speeding up construction of PMR quadtree-based spatial indexes
The VLDB Journal — The International Journal on Very Large Data Bases
Parallel Computing - Special issue: High performance computing with geographical data
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
Remote thin-client access to spatial database systems
dg.o '02 Proceedings of the 2002 annual national conference on Digital government research
ACM Transactions on Database Systems (TODS)
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Spatial indexing on tetrahedral meshes
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
The PR-star octree: a spatio-topological data structure for tetrahedral meshes
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
A new method termed population analysis is presented for approximating the distribution of node occupancies in hierarchical data structures which store a variable number of geometric data items per node. The basic idea is to describe a dynamic data structure as a set of populations which are permitted to transform into one another according to certain rules. The transformation rules are used to obtain a set of equations describing a population distribution which is stable under insertion of additional information into the structure. These equations can then be solved, either analytically or numerically, to obtain the population distribution. Hierarchical data structures are modeled by letting each population represent the nodes of a given occupancy. A detailed analysis of quadtree data structures for storing point data is presented, and the results are compared to experimental data. Two phenomena referred to as aging and phasing are defined and shown to account for the differences between the experimental results and those predicted by the model. The population technique is compared with statistical methods of analyzing similar data structures.