Distance-sensitive planar point location
From MaRDI portal
Publication:283883
DOI10.1016/J.COMGEO.2016.02.001zbMATH Open1344.65023OpenAlexW3099105843WikidataQ59782228 ScholiaQ59782228MaRDI 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
Recommendations
Cites Work
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- 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
- Title not available (Why is that?)
- Optimal Search in Planar Subdivisions
- Efficient Point Location in a Convex Spatial Cell-Complex
- Dynamic Trees and Dynamic Point Location
- Optimal Expected-Case Planar Point Location
Cited In (8)
- Dynamic Distribution-Sensitive Point Location
- Optimal Expected-Case Planar Point Location
- Accuracy characterization and measurement point planning for workpiece localization
- Proximate planar point location
- Dynamic Distribution-Sensitive Point Location
- Adaptive Point Location in Planar Convex Subdivisions
- Distance-Sensitive Planar Point Location
- A simple entropy-based algorithm for planar point location
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)
