Dynamic Compressed Hyperoctrees with Application to the N-body Problem
Authors:
- 1 January 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 21-33
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- An Optimal Algorithm for Closest-Pair MaintenanceDiscrete & Computational Geometry, 1998
- Query-Sensitive Ray ShootingInternational Journal of Computational Geometry & Applications, 1997
- Combine and ConquerAlgorithmica, 1997
- Greengard’s N-Body Algorithm is not Order NSIAM Journal on Scientific Computing, 1996
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fieldsJournal of the ACM, 1995
- An optimal algorithm for the on-line closest-pair problemAlgorithmica, 1994
- Approximate closest-point queries in high dimensionsInformation Processing Letters, 1993
- Parallel construction of quadtrees and quality triangulations1993
- A fast algorithm for particle simulationsJournal of Computational Physics, 1987