A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- 3 January 1995
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 42 (1) , 67-90
- https://doi.org/10.1145/200836.200853
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Optimal parallel evaluation of tree-structured computations by raking (extended abstract)Published by Springer Nature ,2006
- Optimal parallel algorithms for point-set and polygon problemsAlgorithmica, 1992
- A simple parallel tree contraction algorithmJournal of Algorithms, 1989
- A fast algorithm for particle simulationsJournal of Computational Physics, 1987
- A hierarchical O(N log N) force-calculation algorithmNature, 1986
- Rapid solution of integral equations of classical potential theoryJournal of Computational Physics, 1985
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- N-body simulations of galaxy clustering. I - Initial conditions and galaxy collapse timesThe Astrophysical Journal, 1979
- Numerical Experiments on Spiral StructureThe Astrophysical Journal, 1970
- Stellar Dynamics in a Discrete Phase SpaceThe Astrophysical Journal, 1968