Distance search techniques in quadtrees and octrees for random particle cluster simulations

Authors:
Sosa-Herrera Antonio;Rodriguez-Romo Suemi
Affiliations:
Computational Science Graduate Program, Universidad Nacional Autónoma de México, Cuautitlán Izcalli, Edo. de México, Mexico;Centre of Theoretical Research, Universidad Nacional Autónoma de México, Cuautitlán Izcalli, Edo. de México, Mexico
Venue:
ISTASC'09 Proceedings of the 9th WSEAS International Conference on Systems Theory and Scientific Computation
Year:
2009

Citing 2
Cited 0

An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)

Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for performing distance queries between a large number of points stored in quadtrees and octrees is developed and tested for the construction of diffusion-limited aggregates. The structure of the trees is the only feature used for the determination of approximate distances at any stage. These techniques allowed us to build DLA clusters with up to 109 particles for the two-dimensional case and up to 108 particles for the three-dimensional case. We also worked with the PDLA model obtaining fractal clusters with up to 1010 and 109 particles for two and three dimension clusters respectively.