Point location in dynamic planar subdivisions
From MaRDI portal
Publication:5116523
Recommendations
Cites work
- scientific article; zbMATH DE number 4211552 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1182923 (Why is no real title available?)
- Computational geometry. Algorithms and applications.
- Decomposable searching problems I. Static-to-dynamic transformation
- Dynamic Point Location in General Subdivisions
- Efficiency of a Good But Not Linear Set Union Algorithm
- Efficient partition trees
- New Results on Dynamic Planar Point Location
- Towards an optimal method for dynamic planar point location
- Worst-case optimal insertion and deletion methods for decomposable searching problems
Cited in
(8)- Fully Dynamic Point Location in a Monotone Subdivision
- Dynamic planar point location with sub-logarithmic local updates
- External memory planar point location with logarithmic updates
- Point Location in Incremental Planar Subdivisions.
- Optimal Point Location in a Monotone Subdivision
- scientific article; zbMATH DE number 742971 (Why is no real title available?)
- New Results on Dynamic Planar Point Location
- Adaptive Point Location in Planar Convex Subdivisions
This page was built for publication: Point location in dynamic planar subdivisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116523)