Expected-case planar point location

ix Chapter

[1]  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.

[2]  Takao Asano,et al.  A new point-location algorithm and its practical efficiency: comparison with existing algorithms , 1984, TOGS.

[3]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[4]  Richard Cole,et al.  Searching and Storing Similar Lists , 2018, J. Algorithms.

[5]  Kurt Mehlhorn.  Best possible bounds for the weighted path length of optimum binary search trees , 1975, Automata Theory and Formal Languages.

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

[7]  D. T. Lee,et al.  Location of a point in a planar subdivision and its applications , 1976, STOC '76.

[8]  Ketan Mulmuley,et al.  Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract) , 1991, SCG.

[9]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

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

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

[12]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[13]  Michael T. Goodrich,et al.  Methods for achieving fast query times in point location data structures , 1997, SODA '97.

[14]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[15]  Raimund Seidel,et al.  On the exact worst case query complexity of planar point location , 2000, SODA '98.

[16]  Ernst P. Mücke,et al.  Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations , 1996, SCG '96.

[17]  Robert E. Tarjan,et al.  Application of a Planar Separator Theorem , 1977, FOCS.

[18]  Sunil Arya,et al.  A simple entropy-based algorithm for planar point location , 2001, SODA '01.

[19]  Sunil Arya,et al.  Nearly optimal expected-case planar point location , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[21]  Csaba D. Tóth.  Binary space partitions for line segments with a limited number of directions , 2002, SODA '02.

[22]  Richard J. Lipton,et al.  Multidimensional Searching Problems , 1976, SIAM J. Comput..

[23]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

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

[25]  Sunil Arya,et al.  Efficient Expected-Case Algorithms for Planar Point Location , 2000, SWAT.

[26]  S. Rao Kosaraju,et al.  A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields , 1995, JACM.

[27]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[28]  Franco P. Preparata,et al.  Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..

[29]  Michael T. Goodrich,et al.  Geometric Data Structures , 2000, Handbook of Computational Geometry.

[30]  Li Yan.  Application of A Planar Separator Theorem , 2001 .

[31]  John Iacono.  Optimal planar point location , 2001, SODA '01.

[32]  Franco P. Preparata,et al.  A New Approach to Planar Point Location , 1981, SIAM J. Comput..

[33]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[34]  Sunil Arya,et al.  Entropy-preserving cuttings and space-efficient planar point location , 2001, SODA '01.