Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Methods for achieving fast query times in point location data structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Bounded-Degree Independent Sets in Planar Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Proximate planar point location
Proceedings of the nineteenth annual symposium on Computational geometry
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Expected asymptotically optimal planar point location
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
A simple entropy-based algorithm for planar point location
ACM Transactions on Algorithms (TALG)
Distribution-sensitive point location in convex subdivisions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Entropy, triangulation, and point location in planar subdivisions
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
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.