Distance-sensitive planar point location

DOI10.1016/j.comgeo.2016.02.001zbMath1344.65023OpenAlexW3099105843WikidataQ59782228 ScholiaQ59782228MaRDI QIDQ283883

Marcel Roeloffzen, Bettina Speckmann, David Eppstein, Boris Aronov, Mark T. de Berg

Publication date: 17 May 2016

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

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

zbMATH Keywords

quadtreealgorithmsubdivisioncomputational geometrydistance-sensitive decompositionpoint location

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Adaptive Point Location in Planar Convex Subdivisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• A sweepline algorithm for Voronoi diagrams
• Triangulating a simple polygon in linear time
• Linear probing and graphs
• Provably good mesh generation
• Expected asymptotically optimal planar point location
• Linear-size nonobtuse triangulation of polygons
• A simple entropy-based algorithm for planar point location
• Entropy, triangulation, and point location in planar subdivisions
• PLANAR POINT LOCATION REVISITED
• Optimal Search in Planar Subdivisions
• Efficient Point Location in a Convex Spatial Cell-Complex
• Dynamic Trees and Dynamic Point Location
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Optimal Expected-Case Planar Point Location