Towards an Optimal Method for Dynamic Planar Point Location
From MaRDI portal
Publication:4562277
DOI10.1137/16M1066506zbMath1408.68040OpenAlexW2904248248MaRDI QIDQ4562277
Timothy M. Chan, Yakov Nekrich
Publication date: 19 December 2018
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1066506
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic fractional cascading
- Fractional cascading. I: A data structuring technique
- Worst-case optimal insertion and deletion methods for decomposable searching problems
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Preserving order in a forest in less than logarithmic time and linear space
- Geometric applications of a randomized optimization technique
- A fast planar partition algorithm. I
- Computational geometry
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- On dynamic range reporting in one dimension
- Decomposable searching problems I. Static-to-dynamic transformation
- Efficient Point Location in a Convex Spatial Cell-Complex
- New Results on Dynamic Planar Point Location
- DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS
- Dynamic Trees and Dynamic Point Location
- Dynamic Point Location in General Subdivisions
- Optimal External Memory Interval Management
- Fully Dynamic Point Location in a Monotone Subdivision
- A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
- Counting and reporting red/blue segment intersections
- Orthogonal range searching on the RAM, revisited
- Fully Dynamic Orthogonal Range Reporting on RAM
This page was built for publication: Towards an Optimal Method for Dynamic Planar Point Location
