Dynamic planar point location with optimal query time
From MaRDI portal
Publication:914389
DOI10.1016/0304-3975(90)90007-5zbMath0701.68049MaRDI QIDQ914389
Roberto Tamassia, Franco P. Preparata
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(90)90007-5
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52A37: Other problems of combinatorial convexity
Related Items
Incremental hive graph, An incremental reconstruction method for dynamic planar point location, Monte Carlo approximation of form factors with error bounded a priori, Dynamic Trees and Dynamic Point Location
Cites Work
- 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