Dynamic planar point location with optimal query time
From MaRDI portal
Publication:5096145
DOI10.1007/BFb0028975zbMath1492.68066OpenAlexW3000022003MaRDI QIDQ5096145
Roberto Tamassia, Franco P. Preparata
Publication date: 16 August 2022
Published in: STACS 89 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0028975
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Biased Search Trees
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- Optimal Point Location in a Monotone Subdivision
- A New Approach to Planar Point Location
- Optimal Search in Planar Subdivisions
- Multidimensional Searching Problems
- Location of a Point in a Planar Subdivision and Its Applications
This page was built for publication: Dynamic planar point location with optimal query time