A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that differs from the optimal one by only lower order terms in the linear comparison tree model.

19th Annual ACM-SIAM Symposium on Discrete Algorithms
Carleton University

Collette, S. (Sébastien), Dujmović, V, Iacono, J. (John), Langerman, S. (Stefan), & Morin, P. (2008). Distribution-sensitive point location in convex subdivisions. Presented at the 19th Annual ACM-SIAM Symposium on Discrete Algorithms.