Entropy, triangulation, and point location in planar subdivisions

It appears your Web browser is not configured to display PDF files. Download adobe Acrobat or click here to download the PDF file.

Click here to download the PDF file.


  • Collette, S.
  • Dujmovic, V.
  • Iacono, J.
  • Langerman, S.
  • Morin, P.




A data structure is presented for point location in connected 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. More specifically, an algorithm is presented that preprocesses a connected planar subdivision, G, of size n and a query distribution, D, to produce a point location data structure for G. The expected number of point-line comparisons performed by this data structure, when the queries are distributed according to D, is H' + O(H^{1/2}+1) where H'=H'(G,D)$ is a lower bound on the expected number of point-line comparisons performed by any linear decision tree for point location in G under the query distribution D. The preprocessing algorithm runs in O(n log n) time and produces a data structure of size O(n). These results are obtained by creating a Steiner triangulation of G that has near-minimum entropy.



Peer Review: 

Published in Peer Reviewed Journal

Faculty Name: 

Faculty of Engineering and Design

Department Name: 

School of Computer Science

Items in CURVE are protected by copyright, with all rights reserved, unless otherwise indicated. They are made available with permission from the author(s).