Expected asymptotically optimal planar point location

Computational Geometry: Theory and Applications

Volumn 29, Issue 1, 2004, Pages 19-22

  Iacono, John ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Distribution sensitive data structures; Point location

Indexed keywords

EID: 77952708241     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.03.010     Document Type: Article

References (10)

1. S. Arya, S. Cheng, D. Mount, and H. Ramesh Efficient expected-case algorithms for planar point location Proc. 7th Scandinavian Workshop on Algorithm Theory Lecture Notes in Comput. Sci. vol. 1851 2000 353 366
2. S. Arya, T. Malamatos, and D.M. Mount Nearly optimal expected-case planar point location Foundations of Computer Science 2000 208 218
3. S. Arya, T. Malamatos, and D.M. Mount Entropy-preserving cuttings and space efficient planar point location Symposium on Discrete Algorithms 2001 256 261
4. S. Arya, T. Malamatos, and D.M. Mount A simple entropy-based algorithm for planar point location Symposium on Discrete Algorithms 2001 262 268
5. B. Ghazelle Triangulating a simple polygon in linear time Discrete Comput. Geom. 6 5 1991 485 524
6. M.T. Goodrich, M. Orletsky, and K. Ramaiyer Methods for achieving fast query times in point location data structures Symposium on Discrete Algorithms 1997 767 776
7. J. Iacono Optimal planar point location Symposium on Discrete Algorithms 2001 340 341
8. D.G. Kirkpatrick Optimum search in planar subdivisions SIAM J. Comput. 12 l 1983 28 35
9. K. Mulmuley A fast planar partition algorithm SIAM J. Comput. 6 1977 235 239
10. R. Seidel A simple and fast incremental algorithm for computing trapezoidal decompositions and for triangulating polygons Computational Geometry 1 1991 51 64