Geometric range searching

In geometric range searching, algorithmic problems of the following type are considered. Given an n-point set P in the plane, build a data structure so that, given a query triangle R, the number of points of P lying in R can be determined quickly. Similar questions can be asked for point sets in higher dimensions, with triangles replaced by simplices or by more complicated shapes. Algorithms of this type are of crucial importance in computational geometry, as they can be used as subroutines in solutions to many seemingly unrelated problems, which are often motivated by practical applications, for instance in computer graphics (ray tracing, hidden-surface removal etc.). We present a survey of theoretical results and the main techniques in geometric range searching.

[1]  David Eppstein,et al.  Approximating center points with iterated radon points , 1993, SCG '93.

[2]  Bernard Chazelle,et al.  An optimal convex hull algorithm in any fixed dimension , 1993, Discret. Comput. Geom..

[3]  Jirí Matousek.  Linear Optimization Queries , 1993, J. Algorithms.

[4]  E. Szemerédi,et al.  A Lower Bound for Heilbronn'S Problem , 1982 .

[5]  Andrew Chi-Chih Yao,et al.  A general approach to d-dimensional geometric queries , 1985, STOC '85.

[6]  Jirí Matousek.  On Vertical Ray Shooting in Arrangements , 1992, Comput. Geom..

[7]  Dennis G. Severance,et al.  Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases , 1976, JACM.

[8]  Mark H. Overmars,et al.  Dynamic partition trees , 1991, BIT Comput. Sci. Sect..

[9]  Jirí Matousek.  Cutting hyperplane arrangements , 1991, Discret. Comput. Geom..

[10]  Kenneth L. Clarkson,et al.  An algorithm for approximate closest-point queries , 1994, SCG '94.

[11]  Alok Aggarwal,et al.  Solving query-retrieval problems by compacting Voronoi diagrams , 1990, STOC '90.

[12]  Bernard Chazelle,et al.  A deterministic view of random sampling and its use in geometry , 1990, Comb..

[13]  John F. Canny,et al.  A general approach to removing degeneracies , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[14]  Ketan Mulmuley.  Randomized multidimensional search trees: further results in dynamic sampling , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[15]  Ketan Mulmuley,et al.  A fast planar partition algorithm, II , 1991, SCG '89.

[16]  Bernard Chazelle.  Filtering Search: A New Approach to Query-Answering , 1983, FOCS.

[17]  Micha Sharir,et al.  Almost tight upper bounds for the single cell and zone problems in three dimensions , 1994, SCG '94.

[18]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[19]  Jirí Matousek,et al.  Ray Shooting and Parametric Search , 1993, SIAM J. Comput..

[20]  F. Frances Yao,et al.  A 3-space partition and its applications , 1983, STOC.

[21]  Emo Welzl,et al.  On Spanning Trees with Low Crossing Numbers , 1992, Data Structures and Efficient Algorithms.

[22]  Jirí Matousek,et al.  Approximations and optimal geometric divide-and-conquer , 1991, STOC '91.

[23]  Éva Tardos,et al.  Using separation algorithms in fixed dimension , 1990, SODA '90.

[24]  Roberto Tamassia,et al.  Efficient Point Location in a Convex Spatial Cell-Complex , 1989, SIAM J. Comput..

[25]  Jirí Matousek,et al.  Range searching with efficient hierarchical cuttings , 1992, SCG '92.

[26]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[27]  Leonidas J. Guibas,et al.  Lines in space - combinatorics, algorithms and applications , 1989, Symposium on the Theory of Computing.

[28]  Ketan Mulmuley.  Randomized multidimensional search trees (extended abstract): dynamic sampling , 1991, SCG '91.

[29]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[30]  Micha Sharir,et al.  On the Zone of a Surface in a Hyperplane Arrangement , 1991, WADS.

[31]  Bernard Chazelle,et al.  The complexity of computing partial sums off-line , 1991, Int. J. Comput. Geom. Appl..

[32]  Richard Pollack,et al.  Discrete and Computational Geometry: Papers from the DIMACS Special Year , 1991, Discrete and Computational Geometry.

[33]  Bernard Chazelle,et al.  A Functional Approach to Data Structures and Its Use in Multidimensional Searching , 1988, SIAM J. Comput..

[34]  Sivan Toledo,et al.  Applications of parametric searching in geometric optimization , 1992, SODA '92.

[35]  Bernard Chazelle,et al.  Point Location Among Hyperplanes and Unidirectional Ray-shooting , 1994, Comput. Geom..

[36]  Jirí Matousek,et al.  Linear optimization queries , 1992, SCG '92.

[37]  Mark H. Overmars.  Efficient Data Structures for Range Searching on a Grid , 1988, J. Algorithms.

[38]  Micha Sharir,et al.  Counting Circular Arc Intersections , 1993, SIAM J. Comput..

[39]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[40]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[41]  Kenneth L. Clarkson,et al.  A Randomized Algorithm for Closest-Point Queries , 1988, SIAM J. Comput..

[42]  Micha Sharir,et al.  Applications of a new space-partitioning technique , 1993, Discret. Comput. Geom..

[43]  Michael L. Fredman,et al.  Lower Bounds on the Complexity of Some Optimal Data Structures , 1981, SIAM J. Comput..

[44]  Micha Sharir,et al.  Castles in the air revisited , 1992, SCG '92.

[45]  Christopher J. Van Wyk,et al.  Efficient exact arithmetic for computational geometry , 1993, SCG '93.

[46]  Bernard Chazelle,et al.  Quasi-optimal upper bounds for simplex range searching and new zone theorems , 1990, SCG '90.

[47]  Jirí Matousek,et al.  Randomized Optimal Algorithm for Slope Selection , 1991, Inf. Process. Lett..

[48]  Leonidas J. Guibas,et al.  Diameter, width, closest line pair, and parametric searching , 1993, Discret. Comput. Geom..

[49]  Richard Cole,et al.  Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.

[50]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.

[51]  Bernard Chazelle,et al.  Lower bounds for orthogonal range searching: part II. The arithmetic model , 1990, JACM.

[52]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[53]  Remo Guidieri.  Res , 1995, RES: Anthropology and Aesthetics.

[54]  Otfried Cheong.  Dynamic Maintenance of Geometric Structures Made Easy , 1991, FOCS.

[55]  George S. Lueker,et al.  Adding range restriction capability to dynamic data structures , 1985, JACM.

[56]  M. Pellegrini,et al.  Finding stabbing lines in 3-space , 1992, Discret. Comput. Geom..

[57]  Jon Louis Bentley,et al.  Decomposable Searching Problems I: Static-to-Dynamic Transformation , 1980, J. Algorithms.

[58]  L. Chew.  Building Voronoi Diagrams for Convex Polygons in Linear Expected Time , 1990 .

[59]  John F. Canny,et al.  An efficient approach to removing geometric degeneracies , 1992, SCG '92.

[60]  Otfried Cheong,et al.  On ray shooting in convex polytopes , 1993, Discret. Comput. Geom..

[61]  Kenneth L. Clarkson,et al.  New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

[62]  Herbert Edelsbrunner,et al.  Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time , 1986, Inf. Process. Lett..

[63]  Leonidas J. Guibas,et al.  Lines in space-combinators, algorithms and applications , 1989, STOC '89.

[64]  Richard Cole,et al.  Partitioning Point Sets in 4 Dimensions , 2018, ICALP.

[65]  O. Schwarzkopf.  Ray shooting in convex polytopes , 1992, SoCG 1992.

[66]  Dan Gusfield,et al.  Parametric Combinatorial Computing and a Problem of Program Module Distribution , 1983, JACM.

[67]  Bernard Chazelle,et al.  Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine , 1992, ICALP.

[68]  Pankaj K. AgarwalDepartment.  On Stabbing Lines for Convex Polyhedra in 3 D 1 , 1993 .

[69]  Raimund Seidel,et al.  The Nature and Meaning of Perturbations in Geometric Computing , 1994, STACS.

[70]  Bernard Chazelle,et al.  The power of geometric duality , 1985, BIT Comput. Sci. Sect..

[71]  Pankaj K. Agarwal,et al.  Partitioning arrangements of lines II: Applications , 2011, Discret. Comput. Geom..

[72]  Jirí Matousek,et al.  Tight upper bounds for the discrepancy of half-spaces , 1995, Discret. Comput. Geom..

[73]  Raimund Seidel,et al.  Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..

[74]  Edith Cohen,et al.  Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs , 1989, STOC '89.

[75]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[76]  Endre Szemerédi,et al.  An Optimal-Time Algorithm for Slope Selection , 1989, SIAM J. Comput..

[77]  Bernard Chazelle,et al.  Quasi-optimal range searching in spaces of finite VC-dimension , 1989, Discret. Comput. Geom..

[78]  David M. Mount,et al.  A randomized algorithm for slope selection , 1992, Int. J. Comput. Geom. Appl..

[79]  M. Sharir,et al.  New bounds for lower envelopes in three dimensions, with applications to visibility in terrains , 1993, SCG '93.

[80]  David G. Kirkpatrick,et al.  Polygonal Intersection Searching , 1982, Inf. Process. Lett..

[81]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[82]  Vladlen Koltun.  Almost tight upper bounds for lower envelopes in higher dimensions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[83]  Jirí Matousek,et al.  On range searching with semialgebraic sets , 1992, Discret. Comput. Geom..

[84]  David P. Dobkin,et al.  Partitioning Space for Range Queries , 1989, SIAM J. Comput..

[85]  Jirí Matousek,et al.  Good Splitters for Counting Points in Triangles , 1992, J. Algorithms.

[86]  Dan E. Willard,et al.  Polygon Retrieval , 1982, SIAM journal on computing (Print).

[87]  Bernard Chazelle,et al.  Cutting hyperplanes for divide-and-conquer , 1993, Discret. Comput. Geom..

[88]  Dan E. Willard,et al.  New Data Structures for Orthogonal Range Queries , 1985, SIAM J. Comput..

[89]  Richard Cole,et al.  Geometric Retrieval Problems , 1983, FOCS.

[90]  Raimund Seidel,et al.  A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons , 1991, Comput. Geom..

[91]  Emo Welzl,et al.  Partition trees for triangle counting and other range searching problems , 1988, SCG '88.

[92]  Marco Pellegrini,et al.  Incidence and nearest-neighbor problems for lines in 3-space , 1992, SCG '92.

[93]  Prof. Dr. Kurt Mehlhorn,et al.  Data Structures and Algorithms 3 , 2012, EATCS Monographs on Theoretical Computer Science.

[94]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[95]  David Avis.  Non-Partitionable Point Sets , 1984, Inf. Process. Lett..

[96]  Edith Cohen,et al.  Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs , 1993, JACM.

[97]  Leonidas J. Guibas,et al.  A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications , 1991, Theor. Comput. Sci..

[98]  Micha Sharir,et al.  On the zone of a surface in a hyperplane arrangement , 1993, Discret. Comput. Geom..

[99]  Richard Cole,et al.  On k-Hulls and Related Problems , 1987, SIAM J. Comput..

[100]  F. Frances Yao,et al.  Point Retrieval for Polygons , 1986, J. Algorithms.

[101]  Noga Alon,et al.  Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension , 1987, SCG '87.

[102]  B.,et al.  Halfspace Range Search : An Algorithmic Application of k-Sets , 2022 .

[103]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.

[104]  Micha Sharir,et al.  An expander-based approach to geometric optimization , 1993, SCG '93.

[105]  Jirí Matousek,et al.  Discrepancy and approximations for bounded VC-dimension , 1993, Comb..

[106]  David Haussler,et al.  Sphere Packing Numbers for Subsets of the Boolean n-Cube with Bounded Vapnik-Chervonenkis Dimension , 1995, J. Comb. Theory, Ser. A.

[107]  Bernard Chazelle,et al.  How hard is half-space range searching? , 1993, Discret. Comput. Geom..

[108]  Jirí Matousek,et al.  Good splitters for counting points in triangles , 1989, SCG '89.

[109]  Leonidas J. Guibas,et al.  Implicitly representing arrangements of lines or segments , 2011, SCG '88.

[110]  Kurt Mehlhorn,et al.  On degeneracy in geometric computations , 1994, SODA '94.

[111]  Bernard Chazelle,et al.  Lower bounds for orthogonal range searching: I. The reporting case , 1990, JACM.

[112]  Jirí Matousek,et al.  Efficient partition trees , 1992, Discret. Comput. Geom..

[113]  Ketan Mulmuley.  Randomized geometric algorithms and pseudo-random generators , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[114]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[115]  David P. Dobkin,et al.  Space Searching for Intersecting Objects , 1987, J. Algorithms.

[116]  Jirí Matousek,et al.  Efficient partition trees , 1991, SCG '91.

[117]  Jirí Matousek.  Construction of ɛ-nets , 1990, Discret. Comput. Geom..

[118]  Ketan Mulmuley.  Randomized multidimensional search trees: lazy balancing and dynamic shuffling , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[119]  Ketan Mulmuley.  A Fast Planar Partition Algorithm, I , 1990, J. Symb. Comput..

[120]  Pankaj K. Agarwal.  On Stabbling Lines for Convex Polyhedra in 3D , 1994, Comput. Geom..

[121]  John F. Canny,et al.  A General Approach to Removing Degeneracies , 1995, SIAM J. Comput..

[122]  Jirí Matousek,et al.  Reporting Points in Halfspaces , 1992, Comput. Geom..

[123]  Ketan Mulmuley,et al.  Computational geometry - an introduction through randomized algorithms , 1993 .

[124]  B. Chazelle.  Lower bounds on the complexity of polytope range searching , 1989 .

[125]  Micha Sharir,et al.  Storing line segments in partition trees , 1990, BIT.

[126]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[127]  Bernard Chazelle,et al.  On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.