Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 133-145 |
| Number of pages | 13 |
| Journal | Information Sciences |
| Volume | 218 |
| DOIs | |
| State | Published - Jan 1 2013 |
ASJC Scopus Subject Areas
- Software
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence
Keywords
- Continuum dynamics
- Crowd simulation
- Octree
- Particle simulations
- Point-region quadtree
- Quadtree
Fingerprint
Dive into the research topics of 'Dynamic point-region quadtrees for particle simulations'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS