Simplex Range Searching and Its Variants: A Review

  • Pankaj K. Agarwal


A central problem in computational geometry, range searching arises in many applications, and numerous geometric problems can be formulated in terms of range searching. A typical range-searching problem has the following form. Let S be a set of n points in \(\mathbb{R}^{d}\), and let \(\mathbb{R}\) be a family of subsets of \(\mathbb{R}^{d}\); elements of \(\mathbb{R}\) are called ranges. Preprocess S into a data structure so that for a query range \(\gamma \in \mathbb{R}\), the points in Sγ can be reported or counted efficiently. Notwithstanding extensive work on range searching over the last four decades, it remains an active research area. A series of papers by Jirka Matoušek and others in the late 1980s and the early 1990s had a profound impact not only on range searching but also on computational geometry as a whole. This chapter reviews the known results and techniques, including recent developments, for simplex range searching and its variants.


  1. 1.
    P. Afshani, Improved pointer machine and I/O lower bounds for simplex range reporting and related problems. Int. J. Comput. Geom. Appl. 23, 233–252 (2013)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    P. Afshani, T.M. Chan, Optimal halfspace range reporting in three dimensions, in Proceedings of 20th Annual ACM-SIAM Symposium on Discrete Algorithm, New York, 2009, pp. 180–186Google Scholar
  3. 3.
    P. Afshani, C.H. Hamilton, N. Zeh, A general approach for cache-oblivious range reporting and approximate range counting. Comput. Geom. Theory Appl. 43, 700–712 (2010)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    P.K. Agarwal, Range searching, in Handbook of Discrete and Computational Geometry, ed. by J.E. Goodman, J. O’Rourke, C. Toth (CRC Press LLC, Boca Raton, 2017, to appear)Google Scholar
  5. 5.
    P.K. Agarwal, J. Erickson, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry ed. By B. Chazelle, J.E. Goodman, R. Pollack. Contemporary Mathematics, vol. 223 (American Mathematical Society, Providence, 1999), pp. 1–56Google Scholar
  6. 6.
    P.K. Agarwal, J. Matoušek, Ray shooting and parametric search. SIAM J. Comput. 22, 794–806 (1993)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    P.K. Agarwal, J. Matoušek, On range searching with semialgebraic sets. Discret. Comput. Geom. 11, 393–418 (1994)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    P.K. Agarwal, J. Matousek, M. Sharir, On range searching with semialgebraic sets. II. SIAM J. Comput. 42, 2039–2062 (2013)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    P.K. Agarwal, M. Sharir, Applications of a new space-partitioning technique. Discret. Comput. Geom. 9, 11–38 (1993)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    P.K. Agarwal, M. Sharir, Ray shooting amidst convex polygons in 2D. J. Algorithms 21, 508–519 (1996)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    P.K. Agarwal, M. Sharir, Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions. SIAM J. Comput. 25, 100–116 (1996)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    P.K. Agarwal, M. van Kreveld, M. Overmars, Intersection queries in curved objects. J. Algorithms 15, 229–266 (1993)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    A. Aggarwal, M. Hansen, T. Leighton, Solving query-retrieval problems by compacting Voronoi diagrams, in Proceedings of 22nd Annual ACM Symposium on Theory computing, Baltimore, 1990, pp. 331–340Google Scholar
  14. 14.
    B. Aronov, S. Har-Peled, On approximating the depth and related problems. SIAM J. Comput. 38, 899–921 (2008)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    B. Aronov, M. Sharir, Approximate halfspace range counting. SIAM J. Comput. 39, 2704–2725 (2010)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    S. Arya, D.M. Mount, Approximate range searching. Comput. Geom. Theory Appl. 17, 135–152 (2000)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    S. Arya, G.D. da Fonseca, D.M. Mount, Approximate polytope membership queries. CoRR (2016). abs/1604.01183Google Scholar
  18. 18.
    S. Arya, G.D. da Fonseca, D.M. Mount, Optimal approximate polytope membership, in Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (2017), pp. 270–288Google Scholar
  19. 19.
    S. Arya, D.M. Mount, J. Xia, Tight lower bounds for halfspace range searching. Discret. Comput. Geom. 47, 711–730 (2012)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    D. Avis, Non-partitionable point sets. Inform. Process. Lett. 19, 125–129 (1984)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    S. Barone, S. Basu, Refined bounds on the number of connected components of sign conditions on a variety. Discret. Comput. Geom. 47, 577–597 (2012)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    J.L. Bentley, Multidimensional binary search trees used for associative searching. Commun. ACM 18, 509–517 (1975)CrossRefMATHGoogle Scholar
  23. 23.
    J.L. Bentley, Multidimensional divide-and-conquer. Commun. ACM 23, 214–229 (1980)MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    H. Brönnimann, B. Chazelle, J. Pach, How hard is halfspace range searching. Discret. Comput. Geom. 10, 143–155 (1993)CrossRefMATHGoogle Scholar
  25. 25.
    T.M. Chan, Fixed-dimensional linear programming queries made easy, in Proceedings of 12th Annual ACM Symposium on Computational Geometry, Philadelphia, 1996, pp. 284–290Google Scholar
  26. 26.
    T.M. Chan, Geometric applications of a randomized optimization technique. Discret. Comput. Geom. 22, 547–567 (1999)MathSciNetCrossRefMATHGoogle Scholar
  27. 27.
    T.M. Chan, Random sampling, halfspace range reporting, and construction of ( ≤ k)-levels in three dimensions. SIAM J. Comput. 30, 561–575 (2000)MathSciNetCrossRefMATHGoogle Scholar
  28. 28.
    T.M. Chan, Optimal partition trees. Discret. Comput. Geom. 47, 661–690 (2012)MathSciNetCrossRefMATHGoogle Scholar
  29. 29.
    T.M. Chan, K. Tsakalidis, Optimal deterministic algorithms for 2-D and 3-D shallow cuttings, in Proceedings of 31st International Symposium on Computational Geometry, Eindhoven, 2015, pp. 719–732Google Scholar
  30. 30.
    B. Chazelle, Filtering search: a new approach to query-answering. SIAM J. Comput. 15, 703–724 (1986)MathSciNetCrossRefMATHGoogle Scholar
  31. 31.
    B. Chazelle, A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17, 427–462 (1988)MathSciNetCrossRefMATHGoogle Scholar
  32. 32.
    B. Chazelle, Lower bounds for orthogonal range searching, II: the arithmetic model. J. ACM 37, 439–463 (1990)MathSciNetMATHGoogle Scholar
  33. 33.
    B. Chazelle, Cutting hyperplanes for divide-and-conquer. Discret. Comput. Geom. 9, 145–158 (1993)MathSciNetCrossRefMATHGoogle Scholar
  34. 34.
    B. Chazelle, A spectral approach to lower bounds with applications to geometric searching. SIAM J. Comput. 27, 545–556 (1998)MathSciNetCrossRefMATHGoogle Scholar
  35. 35.
    B. Chazelle, The Discrepancy Method: Randomness and Complexity (Cambridge University Press, New York, 2001)MATHGoogle Scholar
  36. 36.
    B. Chazelle, J. Friedman, A deterministic view of random sampling and its use in geometry. Combinatorica 10, 229–249 (1990)MathSciNetCrossRefMATHGoogle Scholar
  37. 37.
    B. Chazelle, L.J. Guibas, Visibility and intersection problems in plane geometry. Discret. Comput. Geom. 4, 551–581 (1989)MathSciNetCrossRefMATHGoogle Scholar
  38. 38.
    B. Chazelle, L.J. Guibas, D.T. Lee, The power of geometric duality. BIT 25, 76–90 (1989)MathSciNetCrossRefMATHGoogle Scholar
  39. 39.
    B. Chazelle, D. Liu, A. Magen, Approximate range searching in higher dimension. Comput. Geom. Theory Appl. 39, 24–29 (2008)MathSciNetCrossRefMATHGoogle Scholar
  40. 40.
    B. Chazelle, F.P. Preparata, Halfspace range search: an algorithmic application of k-sets. Discret. Comput. Geom. 1, 83–93 (1986)MathSciNetCrossRefMATHGoogle Scholar
  41. 41.
    B. Chazelle, B. Rosenberg, Simplex range reporting on a pointer machine. Comput. Geom. Theory Appl. 5, 237–247 (1996)MathSciNetCrossRefMATHGoogle Scholar
  42. 42.
    B. Chazelle, M. Sharir, E. Welzl, Quasi-optimal upper bounds for simplex range searching and new zone theorems. Algorithmica 8, 407–429 (1992)MathSciNetCrossRefMATHGoogle Scholar
  43. 43.
    B. Chazelle, E. Welzl, Quasi-optimal range searching in spaces of finite VC-dimension. Discret. Comput. Geom. 4, 467–489 (1989)MathSciNetCrossRefMATHGoogle Scholar
  44. 44.
    S.W. Cheng, R. Janardan, Algorithms for ray-shooting and intersection searching. J. Algorithms 13, 670–692 (1992)MathSciNetCrossRefMATHGoogle Scholar
  45. 45.
    K.L. Clarkson, New applications of random sampling in computational geometry. Discret. Comput. Geom. 2, 195–222 (1987)MathSciNetCrossRefMATHGoogle Scholar
  46. 46.
    K.L. Clarkson, A randomized algorithm for closest-point queries. SIAM J. Comput. 17, 830–847 (1988)MathSciNetCrossRefMATHGoogle Scholar
  47. 47.
    K.L. Clarkson, Las Vegas algorithms for linear and integer programming. J. ACM 42, 488–499 (1995)CrossRefMATHGoogle Scholar
  48. 48.
    R. Cole, Partitioning point sets in 4 dimensions, in Proceedings of 12th International Colloquium on Automata, Languages, and Programming, Nafplio. Lecture Notes Computer Science, vol. 194 (Springer, 1985), pp. 111–119Google Scholar
  49. 49.
    R. Cole, C.K. Yap, Geometric retrieval problems. Inform. Control 63, 39–57 (1984)MathSciNetCrossRefMATHGoogle Scholar
  50. 50.
    G.D. da Fonseca, D.M. Mount, Approximate range searching: the absolute model. Comput. Geom. Theory Appl. 43, 434–444 (2010)MathSciNetCrossRefMATHGoogle Scholar
  51. 51.
    M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications (Springer, Berlin, 1997)CrossRefMATHGoogle Scholar
  52. 52.
    D.P. Dobkin, H. Edelsbrunner, Space searching for intersecting objects. J. Algorithms 8, 348–361 (1987)MathSciNetCrossRefMATHGoogle Scholar
  53. 53.
    D.P. Dobkin, D.G. Kirkpatrick, A linear algorithm for determining the separation of convex polyhedra. J. Algorithms 6, 381–392 (1985)MathSciNetCrossRefMATHGoogle Scholar
  54. 54.
    H. Edelsbrunner, D.G. Kirkpatrick, H.A. Maurer, Polygonal intersection searching. Inform. Process. Lett. 14, 74–79 (1982)MathSciNetCrossRefMATHGoogle Scholar
  55. 55.
    H. Edelsbrunner, H.A. Maurer, A space-optimal solution of general region location. Theoret. Comput. Sci. 16, 329–336 (1981)MathSciNetCrossRefMATHGoogle Scholar
  56. 56.
    H. Edelsbrunner, E. Welzl, Halfplanar range search in linear space and O(n 0. 695) query time. Inform. Process. Lett. 23, 289–293 (1986)Google Scholar
  57. 57.
    J. Erickson, New lower bounds for halfspace emptiness, in Proceedings of 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, 1996, pp. 472–481Google Scholar
  58. 58.
    J. Erickson, New lower bounds for Hopcroft’s problem. Discret. Comput. Geom. 16, 389–418 (1996)MathSciNetCrossRefMATHGoogle Scholar
  59. 59.
    J. Erickson, Space-time tradeoffs for emptiness queries. SIAM J. Comput. 19, 1968–1996 (2000)MathSciNetCrossRefMATHGoogle Scholar
  60. 60.
    M.L. Fredman, A lower bound on the complexity of orthogonal range queries. J. ACM 28, 696–705 (1981)MathSciNetCrossRefMATHGoogle Scholar
  61. 61.
    M.L. Fredman, Lower bounds on the complexity of some optimal data structures. SIAM J. Comput. 10, 1–10 (1981)MathSciNetCrossRefMATHGoogle Scholar
  62. 62.
    V. Gaede, O. Günther, Multidimensional access methods. ACM Comput. Surv. 30, 170–231 (1998)CrossRefGoogle Scholar
  63. 63.
    L. Guth, N.H. Katz, On the Erdős distinct distances problem in the plane. Annals Math. 181, 155–190 (2015)MathSciNetCrossRefMATHGoogle Scholar
  64. 64.
    S. Har-Peled, M. Sharir, Relative (p, \(\epsilon\))-approximations in geometry. Discret. Comput. Geom. 45, 462–496 (2011)MathSciNetCrossRefMATHGoogle Scholar
  65. 65.
    D. Haussler, E. Welzl, Epsilon-nets and simplex range queries. Discret. Comput. Geom. 2, 127–151 (1987)CrossRefMATHGoogle Scholar
  66. 66.
    J. Hershberger, S. Suri, A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms 18, 403–431 (1995)MathSciNetCrossRefMATHGoogle Scholar
  67. 67.
    P. Indyk, Nearest neighbors in high-dimensional spaces, in Handbook of Discrete and Computational Geometry, ed. by J.E. Goodman, J.O’Rourke, C. Toth (CRC Press LLC, Boca Raton, 2017), p. to appearGoogle Scholar
  68. 68.
    H. Kaplan, E. Ramos, M. Sharir, Range minima queries with respect to a random permutation, and approximate range counting. Discret. Comput. Geom. 45, 3–33 (2011)MathSciNetCrossRefMATHGoogle Scholar
  69. 69.
    H. Kaplan, N. Rubin, M. Sharir, Linear data structures for fast ray-shooting amidst convex polyhedra. Algorithmica 55, 283–310 (2009)MathSciNetCrossRefMATHGoogle Scholar
  70. 70.
    V. Koltun, Sharp bounds for vertical decompositions of linear arrangements in four dimensions. Discret. Comput. Geom. 31, 435–460 (2004)MathSciNetCrossRefMATHGoogle Scholar
  71. 71.
    K.G. Larsen, On range searching in the group model and combinatorial discrepancy. SIAM J. Comput. 43, 673–686 (2014)MathSciNetCrossRefMATHGoogle Scholar
  72. 72.
    K.G. Larsen, H.L. Nguyen, Improved range searching lower bounds, in Proceedings of 28th Annual Symposium Computational Geometry, Chapel Hill, 2012, pp. 171–178Google Scholar
  73. 73.
    G.S. Lueker, A data structure for orthogonal range queries, in Proceedings of 19th Annual IEEE Symposium on Foundations of Computer Science, 1978, Ann Arbor, pp. 28–34Google Scholar
  74. 74.
    J. Matoušek, Construction of ε-nets. Discret. Comput. Geom. 5, 427–448 (1990)MathSciNetCrossRefMATHGoogle Scholar
  75. 75.
    J. Matoušek, Cutting hyperplane arrangements. Discret. Comput. Geom. 6, 385–406 (1991)MathSciNetCrossRefMATHGoogle Scholar
  76. 76.
    J. Matoušek, Efficient partition trees. Discret. Comput. Geom. 8, 315–334 (1992)MathSciNetCrossRefMATHGoogle Scholar
  77. 77.
    J. Matoušek, Reporting points in halfspaces. Comput. Geom. Theory Appl. 2, 169–186 (1992)MathSciNetCrossRefMATHGoogle Scholar
  78. 78.
    J. Matoušek, Linear optimization queries. J. Algorithms 14, 432–448 (1993)MathSciNetCrossRefMATHGoogle Scholar
  79. 79.
    J. Matoušek, Range searching with efficient hierarchical cuttings. Discret. Comput. Geom. 10, 157–182 (1993)MathSciNetCrossRefMATHGoogle Scholar
  80. 80.
    J. Matoušek, Geometric range searching. ACM Comput. Surv. 26, 421–461 (1994)Google Scholar
  81. 81.
    J. Matoušek, Using the Borsuk-Ulam Theorem (Springer, Heidelberg, 2003)MATHGoogle Scholar
  82. 82.
    J. Matousek, Z. Patáková, Multilevel polynomial partitions and simplified range searching. Discret. Comput. Geom. 54, 22–41 (2015)MathSciNetCrossRefMATHGoogle Scholar
  83. 83.
    J. Matousek, O. Schwarzkopf, Linear optimization queries, in Proceedings of 8th Annual Symposium on Computational Geometry, Berlin, 1992, pp. 16–25Google Scholar
  84. 84.
    J. Matoušek, O. Schwarzkopf, On ray shooting in convex polytopes. Discret. Comput. Geom. 10, 215–232 (1993)MathSciNetCrossRefMATHGoogle Scholar
  85. 85.
    N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30, 852–865 (1983)MathSciNetCrossRefMATHGoogle Scholar
  86. 86.
    J. Nievergelt, P. Widmayer, Spatial data structures: concepts and design choices, in Handbook of Computational Geometry, ed. By J.-R. Sack, J. Urrutia (Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000), pp. 725–764CrossRefGoogle Scholar
  87. 87.
    M. Pocchiola, G. Vegter, Pseudo-triangulations: theory and applications, in Proceedings of 12th Annual ACM Symposium on Computational Geometry, Philadelphia, 1996, pp. 291–300Google Scholar
  88. 88.
    S. Rahul, Approximate range counting revisited. CoRR, abs/1512.01713 (2015)Google Scholar
  89. 89.
    E.A. Ramos, On range reporting, ray shooting and k-level construction, in Proceedings of the 15th Annual Symposium on Computational Geometry (1999), pp. 390–399Google Scholar
  90. 90.
    E.A. Ramos, Linear programming queries revisited, in Proceedings of 16th Symposium on Computational Geometry, Hong Kong, 2000, pp. 176–181Google Scholar
  91. 91.
    H.W. Scholten, M.H. Overmars, General methods for adding range restrictions to decomposable searching problems. J. Symb. Comput. 7, 1–10 (1989)MathSciNetCrossRefMATHGoogle Scholar
  92. 92.
    M. Sharir, H. Shaul, Semialgebraic range reporting and emptiness searching with applications. SIAM J. Comput. 40, 1045–1074 (2011)MathSciNetCrossRefMATHGoogle Scholar
  93. 93.
    E. Welzl, Partition trees for triangle counting and other range searching problems, in Proceedings of 4th Annual ACM Symposium on Computational Geometry, Urbana-Champaign, 1988, pp. 23–33Google Scholar
  94. 94.
    D.E. Willard, Polygon retrieval. SIAM J. Comput. 11, 149–165 (1982)MathSciNetCrossRefMATHGoogle Scholar
  95. 95.
    F.F. Yao, A 3-space partition and its applications, in Proceedings of 15th Annual ACM Symposium on Theory of Computing, Boston, 1983, pp. 258–263Google Scholar
  96. 96.
    A.C. Yao, On the complexity of maintaining partial sums. SIAM J. Comput. 14, 277–288 (1985)MathSciNetCrossRefMATHGoogle Scholar
  97. 97.
    F.F. Yao, D.P. Dobkin, H. Edelsbrunner, M.S. Paterson, Partitioning space for range queries. SIAM J. Comput. 18, 371–384 (1989)MathSciNetCrossRefMATHGoogle Scholar
  98. 98.
    A.C. Yao, F.F. Yao, A general approach to D-dimensional geometric queries, in Proceedings of 17th Annual ACM Symposium on Theory of Computing, Providence, 1985, pp. 163–168Google Scholar

Copyright information

© Springer International publishing AG 2017

Authors and Affiliations

  1. 1.Department of Computer ScienceDuke UniversityDurhamUSA

Personalised recommendations