Optimal planar point location

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 340-341

  Iacono, John ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

EID: 64049091682     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan, Efficient Expected-Case Algorithms for Planar Point Location, Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, p.353-366, July 05-07, 2000
2. Bernard Chazelle, Triangulating a simple polygon in linear time, Discrete & Computational Geometry, v.6 n.5, p.485-524, 1991
3. Michael T. Goodrich, Mark Orletsky, Kumar Ramaiyer, Methods for achieving fast query times in point location data structures, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.757-766, January 05-07, 1997, New Orleans, Louisiana, United States
4. D. G. Kirkpatrick. Optimum search in planar subdivisions. SIAM J. Comput., 12(1):28-35, 1983.