Algorithms for dynamic closest pair and n-body potential fields

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 263-272

  Callahan, Paul B ^a   Kosaraju, S Rao ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; GEOMETRY; NEAREST NEIGHBOR SEARCH;

ALGEBRAIC MODELING; EUCLIDEAN SPACES; FAST MULTIPOLE METHOD; NEAREST NEIGHBORS; POINT INSERTIONS; POTENTIAL FIELD; WELL-SEPARATED PAIR DECOMPOSITIONS; WORST-CASE COMPLEXITY;

QUERY PROCESSING;

EID: 38049097376     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. P. K. Agarwal, H. Edelsbrunner, O. Schwartzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete and Computational Geometry, 6:407-422, 1991.
2. P. K. Agarwal and J. Matousek. Relative neighborhood graphs in three dimensions. In Proceedings Third Annual Symposium on Discrete Algorithms, pages 5865, 1992.
3. S. Arya and D. M. Mount. Approximate nearest-neighbor queries in fixed dimensions. In Proceedings 4th Annual Symposium on Discrete Algorithms, pages 271-280, 1993.
4. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest-neighbor searching. In Proceedings 5th Annual Symposium on Discrete Algorithms, pages 573-582, 1994.
5. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest-neighbor searching, (revised version), 1994.
6. M. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quadtrees and quality triangulations. In Algorithms and Data Structures, Third Workshop, WADS '93, Lecture Notes in Computer Science 709, pages 188-199. Springer-Verlag, 1993.
7. P. B. Callahan. Optimal parallel all-nearest-neighbors using the well-separated pair decomposition. In Proceedings 34th Annual Symposium on Foundations of Computer Science, pages 332-341, 1993.
8. 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. In Proceedings 24th Annual AMC Symposium on the Theory of Computing, pages 546-556, 1992.
9. P. B. Callahan and S. R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proceedings 4th Annual Symposium on Discrete Algorithms, pages 291-300, 1993.
10. K. L. Clarkson. Fast algorithms for the all nearest neighbors problem. In Proceedings 24th Annual Symposium on Foundations of Computer Science, pages 226-232, 1983.
11. G. N. Frederickson. A data structure for dynamically maintaining rooted trees. In Proceedings 4th Annual Symposium on Discrete Algorithms, pages 175-184, 1993.
12. M. Golin, R. Raman, C. Schwarz, and M. Smid. Randomized data structures for the dynamic closest pair problem. In Proceedings 4th Annual Symposium on Discrete Algorithms, pages 301-310, 1993.
13. L. Greengard and V. Rokhlin. A fast algorithm for particle simulations. Journal of Computational Physics, 73:325-348, 1987.
14. L. F. Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. The MIT Press, 1988.
15. S. Kapoor and M. Smid. New techniques for exact and approximate dynamic closest-point problems. In 10th Annual ACM Symposium on Computational Geometry, pages 165-174, 1994.
16. J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computional Geometry and Applications, 1(2):99-107, 1991.
17. J. S. Salowe. Construction of multidimensional spanner graphs with applications to minimum spanning trees. In 7th Annual ACM Symposium on Computational Geometry, pages 256-261, 1991.
18. C. Schwarz, M. Smid, and J. Snoeyink. An optimal algorithm for the on-line closest pair problem. In 8th Annual ACM Symposium on Computational Geometry, pages 330-336, 1992.
19. P. M. Vaidya. An optimal algorithm for the all-nearest-neighbors problem. In Proceedings 27th Annual Symposium Found. Comp. Sc., pages 117-122, 1986.
20. P. M. Vaidya. An O(nlogn) algorithm for the all-nearest-neighbors problem. Discrete and Computational Geometry, 4:101-115, 1989.