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


Antonio S., Suemi R.

9th WSEAS International Conference on Systems Theory and Scientific Computation, Moscow, Russia, 20 - 22 August 2009, pp.81-83 identifier

  • Publication Type: Conference Paper / Full Text
  • City: Moscow
  • Country: Russia
  • Page Numbers: pp.81-83

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 10(9) particles for the two-dimensional case and LIP to 10(8) particles for the three-dimensional case. We also worked with the PDLA model obtaining fractal Clusters with up to 10(10) and 10(9) particles for two and three dimension Clusters respectively.