Simplex Range Searching and Its Variants: A Review

[1]  Guilherme Dias da Fonseca,et al.  Optimal Approximate Polytope Membership , 2016, SODA.

[2]  Saladi Rahul,et al.  Approximate Range Counting Revisited , 2015, SoCG.

[3]  Timothy M. Chan,et al.  Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings , 2015, Discrete & Computational Geometry.

[4]  Maarten Löffler,et al.  Range Searching , 2016, Encyclopedia of Algorithms.

[5]  Zuzana Patáková,et al.  Multilevel Polynomial Partitions and Simplified Range Searching , 2014, Discret. Comput. Geom..

[6]  L. Guth,et al.  On the Erdős distinct distances problem in the plane , 2015 .

[7]  Micha Sharir,et al.  On Range Searching with Semialgebraic Sets II , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[8]  Peyman Afshani.  Improved pointer machine and I/O lower bounds for simplex range reporting and related problems , 2012, SoCG '12.

[9]  Kasper Green Larsen,et al.  Improved range searching lower bounds , 2012, SoCG '12.

[10]  Saugata Basu,et al.  Refined Bounds on the Number of Connected Components of Sign Conditions on a Variety , 2011, Discret. Comput. Geom..

[11]  Sunil Arya,et al.  Tight Lower Bounds for Halfspace Range Searching , 2010, Discret. Comput. Geom..

[12]  Guilherme Dias da Fonseca,et al.  Approximate Polytope Membership Queries , 2018, SIAM J. Comput..

[13]  Kasper Green Larsen.  On Range Searching in the Group Model and Combinatorial Discrepancy , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[14]  Micha Sharir,et al.  Relative (p,ε)-Approximations in Geometry , 2011, Discret. Comput. Geom..

[15]  Micha Sharir,et al.  Semialgebraic Range Reporting and Emptiness Searching with Applications , 2009, SIAM J. Comput..

[16]  Haim Kaplan,et al.  Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting , 2011, Discret. Comput. Geom..

[17]  Timothy M. Chan.  Optimal Partition Trees , 2010, SCG.

[18]  Micha Sharir,et al.  Approximate Halfspace Range Counting , 2010, SIAM J. Comput..

[19]  Sunil Arya,et al.  Space-time tradeoffs for approximate nearest neighbor searching , 2009, JACM.

[20]  M. Sharir,et al.  Relative (p,epsilon)-Approximations in Geometry , 2009, ArXiv.

[21]  Norbert Zeh,et al.  A general approach for cache-oblivious range reporting and approximate range counting , 2009, SCG '09.

[22]  Timothy M. Chan,et al.  Optimal halfspace range reporting in three dimensions , 2009, SODA.

[23]  Haim Kaplan,et al.  Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra , 2008, Algorithmica.

[24]  Guilherme Dias da Fonseca,et al.  Approximate Range Searching: The Absolute Model , 2007, WADS.

[25]  Pankaj K. Agarwal,et al.  Geometric Range Searching and Its Relatives , 2007 .

[26]  Boris Aronov,et al.  On approximating the depth and related problems , 2005, SODA '05.

[27]  Piotr Indyk,et al.  Nearest Neighbors in High-Dimensional Spaces , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[28]  Vladlen Koltun.  Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions , 2004, Discret. Comput. Geom..

[29]  Bernard Chazelle,et al.  Approximate range searching in higher dimension , 2004, CCCG.

[30]  J. Matousek,et al.  Using The Borsuk-Ulam Theorem , 2007 .

[31]  Bernard Chazelle,et al.  The discrepancy method - randomness and complexity , 2000 .

[32]  Edgar A. Ramos.  Linear programming queries revisited , 2000, SCG '00.

[33]  Timothy M. Chan.  Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions , 2000, SIAM J. Comput..

[34]  Jeff Erickson,et al.  Space-Time Tradeoffs for Emptiness Queries , 2000, SIAM J. Comput..

[35]  Jürg Nievergelt,et al.  Spatial Data Structures: Concepts and Design Choices , 2000, Handbook of Computational Geometry.

[36]  Edgar A. Ramos,et al.  On range reporting, ray shooting and k-level construction , 1999, SCG '99.

[37]  R. Pollack,et al.  Advances in Discrete and Computational Geometry , 1999 .

[38]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[39]  Bernard Chazelle.  A Spectral Approach to Lower Bounds with Applications to Geometric Searching , 1998, SIAM J. Comput..

[40]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[41]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[42]  Micha Sharir,et al.  Ray Shooting Amidst Convex Polygons in 2D , 1996, J. Algorithms.

[43]  Je Erickson.  New lower bounds for halfspace emptiness , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[44]  Michel Pocchiola,et al.  Pseudo-triangulations: theory and applications , 1996, SCG '96.

[45]  Timothy M. Chan.  Fixed-dimensional linear programming queries made easy , 1996, SCG '96.

[46]  Micha Sharir,et al.  Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions , 1996, SIAM J. Comput..

[47]  Jeff Erickson,et al.  New lower bounds for Hopcroft's problem , 1995, SCG '95.

[48]  Sunil Arya,et al.  Approximate range searching , 1995, SCG '95.

[49]  Kenneth L. Clarkson,et al.  Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.

[50]  Bernard Chazelle,et al.  Simplex Range Reporting on a Pointer Machine , 1995, Comput. Geom..

[51]  Jirí Matousek,et al.  Geometric range searching , 1994, CSUR.

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

[53]  Subhash Suri,et al.  A pedestrian approach to ray shooting: shoot a ray, take a walk , 1993, SODA '93.

[54]  Mark H. Overmars,et al.  Intersection Queries in Curved Objects , 1993, J. Algorithms.

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

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

[57]  Sunil Arya,et al.  Approximate nearest neighbor queries in fixed dimensions , 1993, SODA '93.

[58]  Siu-Wing Cheng,et al.  Algorithms for Ray-Shooting and Intersection Searching , 1992, J. Algorithms.

[59]  J. Matousek.  Reporting Points in Halfspaces , 1992, Comput. Geom..

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

[61]  Jirí Matousek,et al.  Ray shooting and parametric search , 1992, STOC '92.

[62]  Bernard Chazelle,et al.  How hard is halfspace range searching? , 1992, SCG '92.

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

[64]  Otfried Cheong.  Ray Shooting in Convex Polytopes , 1992, Symposium on Computational Geometry.

[65]  Micha Sharir,et al.  Applications of a New Space Partitioning Technique , 1991, WADS.

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

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

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

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

[70]  Jirí Matousek,et al.  Cutting hyperplane arrangements , 1990, SCG '90.

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

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

[73]  Leonidas J. Guibas,et al.  Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..

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

[75]  Mark H. Overmars,et al.  General Methods for Adding Range Restrictions to Decomposable Searching Problems , 1989, J. Symb. Comput..

[76]  Bernard Chazelle,et al.  A deterministic view of random sampling and its use in geometry , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

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

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

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

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

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

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

[84]  David Haussler,et al.  Epsilon-nets and simplex range queries , 1986, SCG '86.

[85]  Bernard Chazelle,et al.  Halfspace range search: An algorithmic application ofk-sets , 1986, Discret. Comput. Geom..

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

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

[88]  Andrew Chi-Chih Yao.  On the Complexity of Maintaining Partial Sums , 1985, SIAM J. Comput..

[89]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

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

[91]  Richard Cole,et al.  Geometric retrieval problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[92]  Bernard Chazelle,et al.  Filtering search: A new approach to query-answering , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[94]  Leonidas J. Guibas,et al.  The power of geometric duality , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

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

[97]  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).

[98]  Michael L. Fredman,et al.  A Lower Bound on the Complexity of Orthogonal Range Queries , 1981, JACM.

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

[100]  Herbert Edelsbrunner,et al.  A Space-Optimal Solution of General Region Location , 1981, Theor. Comput. Sci..

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

[102]  George S. Lueker,et al.  A data structure for orthogonal range queries , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[103]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.