Fast spatial decomposition and closest pair computation for limited precision input

Algorithmica (New York)

Volumn 28, Issue 3, 2000, Pages 271-287

  Reif, J H ^a   Tate, S R ^b  

^a Duke University   (United States)

^b UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Closest pair; Computational geometry; n Body problem; Spatial decomposition

Indexed keywords

EID: 9444238032     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010040     Document Type: Article

References (12)

1. P. B. Callahan and S. R. Kosaraju, A decomposition of multi-dimensional point sets with applications to k-nearest-neighbors and n-body potential fields, J. Assoc. Comput. Mach., 42 (1995), 67-90.
2. J. Carrier, L. Greengard, and V. Rokhlin, A fast adaptive multipole algorithm for particle simulations, SIAM J. Sci. Statist. Comput., 9 (1988), 669-686.
3. S. Fortune and J. Hopcroft, A note on Rabin's nearest-neighbor algorithm, Inform. Process. Lett., 8 (1979), 20-23.
4. L. Greengard and V. Rokhlin, A fast algorithm for particle simulations, J. Comput. Phys., 73 (1987), 325-348.
5. L. Greengard and V. Rokhlin, On the efficient implementation of the fast multipole algorithm, Tech. Rep. RR-602, Department of Computer Science, Yale University, 1988.
6. S. R. Kosaraju and A. L. Delcher, Optimal parallel evaluation of tree-structured computations by raking, in Proceedings of the 3rd Aegean Workshop on Computing, 1988, pp. 101-110.
7. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
8. M. Rabin, Probabilistic algorithms, in Algorithms and Complexity, Recent Results and New Directions, J. F. Traub, ed., Academic Press, New York, 1976, pp. 21-39.
9. J. H. Reif and S. R. Tate, N-body simulation I: Fast algorithms for potential field evaluation and Trummer's problem, Tech. Rep. N-96-002, Department of Computer Science, University of North Texas, 1996.
10. S. R. Tate and K. Xu, General-purpose spatial decomposition algorithms: experimental results, in Proceedings of ALENEX 00, 2000, pp. 197-216.
11. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett., 6 (1977), 80-82.
12. P. van Emde Boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory, 10 (1977), 99-127.