Expected asymptotically optimal planar point location

DOI10.1016/j.comgeo.2004.03.010zbMath1057.65008OpenAlexW2041808700MaRDI QIDQ1883578

John Iacono

Publication date: 13 October 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.03.010

zbMATH Keywords

triangulationpoint locationentropy bounddistribution-sensitive data structures

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Data structures (68P05)

Related Items (7)

Distance-sensitive planar point location ⋮ Practical distribution-sensitive point location in triangulations ⋮ Adaptive Point Location in Planar Convex Subdivisions ⋮ Biased range trees ⋮ Lower bounds for expected-case planar point location ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Adaptive Planar Point Location

Cites Work

• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• Triangulating a simple polygon in linear time
• Optimal Search in Planar Subdivisions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Expected asymptotically optimal planar point location