TY - GEN

T1 - Optimal planar point location

AU - Iacono, John

PY - 2001

Y1 - 2001

N2 - Given a fixed distribution of point location queries among the regions of a triangulation of the plane, a data structure is presented that achieves, within constant multiplicative factors, the entropy bound on the expected point location query time.

AB - Given a fixed distribution of point location queries among the regions of a triangulation of the plane, a data structure is presented that achieves, within constant multiplicative factors, the entropy bound on the expected point location query time.

KW - Algorithms

KW - Theory

UR - http://www.scopus.com/inward/record.url?scp=64049091682&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=64049091682&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:64049091682

SN - 0898714907

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 340

EP - 341

BT - Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms

T2 - 2001 Operating Section Proceedings, American Gas Association

Y2 - 30 April 2001 through 1 May 2001

ER -