Abstract
Approximate nearest-neighbor searching is an important retrieval problem with numerous applications in science and engineering. This problem has been the subject of many research papers spanning decades of work. Recently, a number of dramatic improvements and extensions have been discovered. In this paper, we will survey some of recent techniques that underlie these developments. In particular, we discuss local convexification, Macbeath regions, Delone sets, and how to apply these concepts to develop new data structures for approximate polytope membership queries and approximate vertical ray-shooting queries.
Research supported by NSF grant CCF–1618866.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
There is a significant literature on approximate nearest-neighbor searching in spaces of high dimension, but the techniques are very different, and it will be beyond the scope of this paper to discuss them.
References
Abdelkader, A., Arya, S., da Fonseca, G.D., Mount, D.M.: Approximate nearest neighbor searching with non-Euclidean and weighted distances. In: Proceedings of 30th Annual ACM-SIAM Symposium on Discrete Algorithms (2019)
Abdelkader, A., Mount, D.M.: Economical delone sets for approximating convex bodies. In: Proceedings of 16th Scandinavian Workshop Algorithm Theory, pp. 4:1–4:12 (2018)
Androulakis, I.P., Maranas, C.D., Floudas, C.A.: \(\alpha \)BB: a global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7, 337–363 (1995)
Arya, S., da Fonseca, G.D., Mount, D.M.: Near-optimal \(\varepsilon \)-kernel construction and related problems. In: Proceedings of 33rd International Symposium on Computational Geometry, pp. 10:1–10:15 (2017). https://arxiv.org/abs/1604.01175
Arya, S., da Fonseca, G.D., Mount, D.M.: On the combinatorial complexity of approximating polytopes. Discrete Comput. Geom. 58, 849–870 (2017)
Arya, S., da Fonseca, G.D., Mount, D.M.: Optimal approximate polytope membership. In: Proceedings of 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 270–288 (2017)
Arya, S., da Fonseca, G.D., Mount, D.M.: Approximate polytope membership queries. SIAM J. Comput. 47, 1–51 (2018)
Arya, S., Malamatos, T.: Linear-size approximate Voronoi diagrams. In: Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 147–155 (2002)
Arya, S., Malamatos, T., Mount, D.M.: Space-efficient approximate Voronoi diagrams. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pp. 721–730 (2002)
Arya, S., Malamatos, T., Mount, D.M.: Space-time tradeoffs for approximate nearest neighbor searching. J. Assoc. Comput. Mach. 57, 1–54 (2009)
Arya, S., Mount, D.M.: Approximate range searching. Comput. Geom. Theory Appl. 17, 135–163 (2000)
Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. Assoc. Comput. Mach. 45(6), 891–923 (1998)
Ball, K.: An elementary introduction to modern convex geometry. In: Levy, S. (ed.) Flavors of Geometry, pp. 1–58. Cambridge University Press, Cambridge (1997). (MSRI Publications, vol. 31)
Bárány, I.: The technique of M-regions and cap-coverings: a survey. Rend. Circ. Mat. Palermo 65, 21–38 (2000)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-540-77974-2
Bertsekas, D.P.: Convexification procedures and decomposition methods for nonconvex optimization problems. J. Optim. Theor. Appl. 29, 169–197 (1979)
Bespamyatnikh, S.N.: Dynamic algorithms for approximate neighbor searching. In: Proceedings of Eighth Canadian Conference on Computational Geometry, pp. 252–257 (1996)
Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: Proceedings of 23rd International Conference on Machine Learning, pp. 97–104 (2006)
Brönnimann, H., Chazelle, B., Pach, J.: How hard is halfspace range searching. Discrete Comput. Geom. 10, 143–155 (1993)
Chan, T.M.: Closest-point problems simplified on the RAM. In: Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 472–473 (2002)
Chazelle, B., Matoušek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21, 579–597 (1996)
Clarkson, K.L.: A randomized algorithm for closest-point queries. SIAM J. Comput. 17(4), 830–847 (1988)
Clarkson, K.L.: Building triangulations using \(\varepsilon \)-nets. In: Proceedings of 38th Annual ACM Symposium on Theory of Computing, pp. 326–335 (2006)
Duncan, C.A., Goodrich, M.T., Kobourov, S.: Balanced aspect ratio trees: combining the advantages of k-d trees and octrees. J. Algorithms 38, 303–333 (2001)
Ewald, G., Larman, D.G., Rogers, C.A.: The directions of the line segments and of the \(r\)-dimensional balls on the boundary of a convex body in Euclidean space. Mathematika 17, 1–20 (1970)
Har-Peled, S.: A replacement for Voronoi diagrams of near linear size. In: Proceedings of 42nd Annual IEEE Symposium on Foundations of Computer, pp. 94–103 (2001)
Har-Peled, S., Kumar, N.: Approximating minimization diagrams and generalized proximity search. SIAM J. Comput. 44, 944–974 (2015)
Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics, and their applications. SIAM J. Comput. 35, 1148–1184 (2006)
Hilbert, D.: Über die gerade linie als kürzeste verbindung zweier punkte. Math. Ann. 46, 91–96 (1895)
Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: Proceedings of 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 798–807 (2004)
Vernicos, C., Walsh, C.: Flag-approximability of convex bodies and volume growth of Hilbert geometries (2016). https://hal.archives-ouvertes.fr/hal-01423693, hAL Archive (hal-01423693i)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Mount, D.M. (2019). New Directions in Approximate Nearest-Neighbor Searching. In: Pal, S., Vijayakumar, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2019. Lecture Notes in Computer Science(), vol 11394. Springer, Cham. https://doi.org/10.1007/978-3-030-11509-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-11509-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11508-1
Online ISBN: 978-3-030-11509-8
eBook Packages: Computer ScienceComputer Science (R0)