Abstract
We present improved reductions of the nearest neighbor searching problem to Point Location in Balls by constructing linear size Approximate Voronoi Diagrams while maintaining the logarithmic search time. We do this first by simplifying the construction of Har-Peled[9] that reduces the number of balls generated by a logarithmic factor to O(n log n). We further reduce the number of balls by a new hierarchical decomposition scheme and a generalization of PLEBs to achieve linear space decomposition for nearest neighbor searching.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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. Journal of the ACM, 45(6):891–923, 1998.
Sunil Arya and Theocharis Malamatos. Linear-size approximate voronoi diagrams. to appear in Proceedings of SODA, 2002.
Sunil Arya and David M. Mount. Approximate nearest neighbor queries in fixed dimension. Proc. of SIAM-ACM SODA, pages 271–280, 1993.
Sunil Arya Theocharis Malamatos and David Mount. Space-efficient approximate voronoi diagrams. Proceedings of ACM STOC, 2002.
D. Attali and J.D. Boissonnat. Complexity of the delau-nay triangulation of points on a smooth surface. http://www-sop.inria.fr/prisme/personnel/boissonnat/papers.html , 2001.
P.B. Callahan and S.R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential elds. J. ACM, pages 42:67–90, 1995.
Kenneth L. Clarkson. An algorithm for approximate closest-point queries. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 160–164, 1994.
J. Erickson. Nice points sets can have nasty delaunay triangulations. In Proc. 17th Annu. ACM Sympos. Comput. Geom.., 2001.
S. Har-Peled. A replacement for voronoi diagrams of near linear size. Proc of IEEE FOCS pages 94–103, 2001.
P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 604–613, 1998.
Eyal Kushilevitz, Rafail Ostrovsky, and Yuval Rabani. Efficient search for approximate nearest neighbour search in high dimensional spaces. In ACM Symposium on Theory of Computing, pages 614–623, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sabharwal, Y., Sharma, N., Sen, S. (2002). Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. In: Agrawal, M., Seth, A. (eds) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2002. Lecture Notes in Computer Science, vol 2556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36206-1_28
Download citation
DOI: https://doi.org/10.1007/3-540-36206-1_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00225-3
Online ISBN: 978-3-540-36206-7
eBook Packages: Springer Book Archive