Closest-point problems simplified on the RAM

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 472-473

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (10)

1. A. Amir, A. Efrat, P. Indyk, and H. Samet. Efficient regular data structures and algorithms for location and proximity problems. In Proc. 40th IEEE Sympos. Found. Comput. Sci., pages 160-170, 1999.
2. 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:891-923, 1998.
3. M. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quadtrees and quality triangulations. Int. J. Comput. Geom. Appi, 9:517-532, 1999.
4. S. N. Besparayatnikh. An optimal algorithm for closest pair maintenance. Discrete Comput. Geom., 19:175-195, 1998.
5. M. Cary. Towards optimal ϵ-approximate nearest neighbor algorithms in constant dimensions. J. Algorithms, to appear. http://www.cs.washington.edu/homes/cary/papers/nn.ps.gz.
6. T. M. Chan. Approximate nearest neighbor queries revisited. Discrete Comp. Geom., 20:359-373, 1998.
7. S. Liao, M. A. Lopez, and S. T. Leutenegger. High dimensional similarity search with space filling curves. In Proc. of Int. Conf. on Data Engineering, 2001. http://www.es.du.edu/"leut/icdeOi.ps.
8. M. A. Lopez and S. Liao. Finding k-closest-pairs efficiently for high dimensional data. In Proc. 12th Canad. Conf. Comput. Geom., pages 197-204, 2000. http://www.cs.unb.ca/conf/cccg/eProceedings/29.ps.gz.
9. J. H. Reif and S. R. Tate. Fast spatial decomposition and closest pair computation for limited precision input. Algorithmica, 28:271-287, 2000.
10. M. Smid. Closest-point problems in computational geometry. In Handbook of Computational Geometry (J. Urrutia and J. Sack, ed.), North-Holland, pages 877-935, 2000.