Distribution-sensitive point location in convex subdivisions

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 is within a constant factor of optimal.

• Type: Conference
• Year: 2008
• Where: SODA
• Authors: Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin
• Keywords: Algorithms, Convex Planar Subdivisions, Data Structure, Point Location, SODA 2008