par Collette, Sébastien 
;Dujmović, Vida V.;Iacono, John ;Langerman, Stefan ;Morin, Pat P.
Référence ACM transactions on algorithms, 8, 3, 29
Publication Publié, 2012-07
;Dujmović, Vida V.;Iacono, John ;Langerman, Stefan ;Morin, Pat P.Référence ACM transactions on algorithms, 8, 3, 29
Publication Publié, 2012-07
Article révisé par les pairs
| Résumé : | 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 (Mathematical Equation Presented) + O( (Mathematical Equation Presented) 1/2 + 1) where (Mathematical Equation Presented)(G, D) is a lower bound on the expected number of point-line comparisons performed by any linear decision tree for point location in Gunder the query distribution D. The preprocessing algorithm runs in O(nlog 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. © 2012 ACM. |
