Optimal planar point location

Given a fixed distribution of point location queries among the regions of a triangulation of the plane, a data structure is presented that achieves, within constant multiplicative factors, the entropy bound on the expected point location query time.

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

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

[3]  Bernard Chazelle,et al.  Triangulating a simple polygon in linear time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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