Adaptive planar point location
From MaRDI portal
Publication:5009786
DOI10.1137/18M1218194OpenAlexW3180328527MaRDI QIDQ5009786FDOQ5009786
Authors: Siu-Wing Cheng, Man-Kit Lau
Publication date: 6 August 2021
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.00715
Recommendations
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General topics in the theory of algorithms (68W01)
Cites Work
- A Mathematical Theory of Communication
- Self-adjusting binary search trees
- Triangulating a simple polygon in linear time
- Expected asymptotically optimal planar point location
- A simple entropy-based algorithm for planar point location
- Entropy, triangulation, and point location in planar subdivisions
- Optimal Search in Planar Subdivisions
- Optimal Expected-Case Planar Point Location
- Optimal Point Location in a Monotone Subdivision
- On the Exact Worst Case Query Complexity of Planar Point Location
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Ray shooting in polygons using geodesic triangulations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On-line construction of the convex hull of a simple polyline
- Instance-optimal geometric algorithms
- Adaptive Point Location in Planar Convex Subdivisions
- Dynamic Distribution-Sensitive Point Location
Cited In (6)
This page was built for publication: Adaptive planar point location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009786)