Dynamic point-region quadtrees for particle simulations

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.

[1]  Yizhou Yu,et al.  Visual Smoke Simulation with Adaptive Octree Refinement , 2002 .

[2]  Michael Shneier,et al.  Path-Length distances for quadtrees , 1981, Inf. Sci..

[3]  Shan Wang,et al.  Location dependent query in a mobile environment , 2003, Inf. Sci..

[4]  Hanan Samet,et al.  Node Distribution in a PR Quadtree , 1990, SSD.

[5]  Clifford A. Shaffer,et al.  Analysis of the Worst Case Space Complexity of a PR Quadtree , 1994, Inf. Process. Lett..

[6]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[7]  Hanan Samet,et al.  Implementing ray tracing with octrees and neighbor finding , 1989, Comput. Graph..

[8]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[9]  Markus H. Gross,et al.  Particle-based fluid simulation for interactive applications , 2003, SCA '03.

[10]  John R. Woodwark,et al.  Compressed Quad Trees , 1984, Comput. J..

[11]  Özgür Ulusoy,et al.  A Quadtree-Based Dynamic Attribute Indexing Method , 1998, Comput. J..

[12]  Bijan G. Mobasseri,et al.  A generalized solution to the quadtree expected complexity problem , 1995, Pattern Recognit. Lett..

[13]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[14]  Chaman L. Sabharwal,et al.  A scalable constraint-based Q-hash indexing for moving objects , 2008, Inf. Sci..

[15]  Kunihiro Chihara,et al.  Particle-Based Fluid Simulation on GPU , 2003 .

[16]  Gabriel Zachmann,et al.  Geometric data structures for computer graphics , 2002, Eurographics.

[17]  Te-Feng Su,et al.  Thinning algorithms based on quadtree and octree representations , 2006, Inf. Sci..

[18]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[19]  B. C. Brookes,et al.  Information Sciences , 2020, Cognitive Skills You Need for the 21st Century.

[20]  Jignesh M. Patel,et al.  Efficient Continuous Skyline Computation , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[21]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[22]  David Eppstein,et al.  The skip quadtree: a simple dynamic data structure for multidimensional data , 2005, SCG.

[23]  F. Harlow,et al.  Numerical Calculation of Time‐Dependent Viscous Incompressible Flow of Fluid with Free Surface , 1965 .