The design and analysis of spatial data structures
The design and analysis of spatial data structures
Node distribution in a PR quadtree
SSD '90 Proceedings of the first symposium on Design and implementation of large spatial databases
Analysis of the worst case space complexity of a PR quadtree
Information Processing Letters
A generalized solution to the quadtree expected complexity problem
Pattern Recognition Letters
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Particle-based fluid simulation for interactive applications
Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation
Location dependent query in a mobile environment
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Introduction to multimedia and mobile agents
The skip quadtree: a simple dynamic data structure for multidimensional data
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Geometric Data Structures for Computer Graphics
Geometric Data Structures for Computer Graphics
Efficient continuous skyline computation
Information Sciences: an International Journal
A scalable constraint-based Q-hash indexing for moving objects
Information Sciences: an International Journal
Thinning algorithms based on quadtree and octree representations
Information Sciences: an International Journal
Particle-based fluid simulation on the GPU
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
| Hi-index | 0.07 |
We propose an algorithm for dynamically updating point-region (PR) quadtrees. Our algorithm is optimized for simultaneous update of data points comprising a quadtree. The intended application area focuses on simulating continuum phenomena, such as crowds, fluids, and smoke. We minimize the number of tree updates by making use of small changes in the positions of data points. We compare the efficiency of the proposed algorithm with two other approaches for updating a quadtree. One of these techniques creates the tree from scratch at each time-step. The second technique subsequently deletes a data point from the tree and reinserts it in its updated position. We achieve significant performance gains with our method in both cases.