Dynamic well-separated pair decomposition made easy

Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005

Volumn , Issue , 2005, Pages 235-238

  Fischer, John ^a   Har Peled, Sariel ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC WELLS; EFFECTIVE DYNAMICS; HIGH PROBABILITY; QUAD TREES; WELL-SEPARATED PAIR DECOMPOSITIONS;

COMPUTATIONAL GEOMETRY;

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

References (8)

1. [AMN+98] S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM, 45(6), 1998.
2. [Aro98] S. Arora. Polynomial-time approximation schemes for euclidean TSP and other geometric problems. J. ACM, 45(5), 1998.
3. [Bar96] Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. 37th Annu. IEEE Symp. Found. Gomput. Sci., pages 183-193, 1996.
4. [Ca!95] P.B.Callahan. Dealing with Higher Dimensions: The Well-Separated Pair Decomposition and Its Applications. PhD thesis, Johns Hopkins University, 1995.
5. [CK95] P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to fc-nearest neighbors and n-body potential fields. J. AGM, 42:67-90, 1995.
6. [Fre97a] G. N. Frederickson. Ambivalent data structures for dynamic 2-edge connectivity and k smallest spanning trees. SI AM J. Gomput., 26(2) :484-538, April 1997.
7. [Fre97b] G. N. Frederickson. A data structure for dynamically maintaining rooted trees. Journal of Algorithms, 24:37-65, 1997.
8. [IndOl] P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In Proc. 4Znd IEEE Symp. Found. Gomput. Sci., pages 10-31, 2001.