Distance-sensitive planar point location

DOI10.1016/J.COMGEO.2016.02.001zbMATH1344.65023OpenAlexW3099105843WikidataQ59782228MaRDI QIDQ283883FDOQ283883

Authors David Eppstein, Marcel Roeloffzen, Bettina Speckmann, Boris Aronov, Mark 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

quadtreealgorithmcomputational geometrydistance-sensitive decompositionpoint locationsubdivision

Mathematics Subject Classification ID

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

Recommendations

• Distance-Sensitive Planar Point Location
• Proximate planar point location
• Entropy, triangulation, and point location in planar subdivisions
• Adaptive point location in planar convex subdivisions
• Adaptive Point Location in Planar Convex Subdivisions

Cites work

• scientific article; zbMATH DE number 3911704 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 2107521 (Why is no real title available?)
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• A Mathematical Theory of Communication
• A simple entropy-based algorithm for planar point location
• A sweepline algorithm for Voronoi diagrams
• Dynamic Trees and Dynamic Point Location
• Efficient Point Location in a Convex Spatial Cell-Complex
• Entropy, triangulation, and point location in planar subdivisions
• Expected asymptotically optimal planar point location
• Linear probing and graphs
• Linear-size nonobtuse triangulation of polygons
• Optimal Expected-Case Planar Point Location
• Optimal Search in Planar Subdivisions
• PLANAR POINT LOCATION REVISITED
• Provably good mesh generation
• Triangulating a simple polygon in linear time

Cited in

(8)

• Optimal Expected-Case Planar Point Location
• Proximate planar point location
• Distance-Sensitive Planar Point Location
• Dynamic Distribution-Sensitive Point Location
• Accuracy characterization and measurement point planning for workpiece localization
• A simple entropy-based algorithm for planar point location
• Dynamic Distribution-Sensitive Point Location
• Adaptive Point Location in Planar Convex Subdivisions

This page was built for publication: Distance-sensitive planar point location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283883)