par Collette, Sébastien 
;Dujmović, Vida V.;Iacono, John ;Langerman, Stefan ;Morin, Pat
Référence Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, page (912-921)
Publication Publié, 2008
;Dujmović, Vida V.;Iacono, John ;Langerman, Stefan ;Morin, PatRéférence Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, page (912-921)
Publication Publié, 2008
Article révisé par les pairs
| Résumé : | 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. |
