Point location in dynamic planar subdivisions

DOI10.4230/LIPICS.SOCG.2018.63zbMATH Open1489.68370arXiv1803.04325MaRDI QIDQ5116523FDOQ5116523

Hee-Kap Ahn, Eunjin Oh

Publication date: 18 August 2020

Full work available at URL: https://arxiv.org/abs/1803.04325

Recommendations

• Dynamic Point Location in General Subdivisions
• Towards an optimal method for dynamic planar point location
• New Results on Dynamic Planar Point Location
• scientific article; zbMATH DE number 742971
• Dynamic planar point location with optimal query time (extended abstract)

zbMATH Keywords

dynamic point locationgeneral subdivision

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Efficient partition trees
• Efficiency of a Good But Not Linear Set Union Algorithm
• Computational geometry. Algorithms and applications.
• Worst-case optimal insertion and deletion methods for decomposable searching problems
• Decomposable searching problems I. Static-to-dynamic transformation
• New Results on Dynamic Planar Point Location
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dynamic Point Location in General Subdivisions
• Towards an Optimal Method for Dynamic Planar Point Location

Cited In (7)

• Optimal Point Location in a Monotone Subdivision
• Title not available (Why is that?)
• New Results on Dynamic Planar Point Location
• External memory planar point location with logarithmic updates
• Adaptive Point Location in Planar Convex Subdivisions
• Fully Dynamic Point Location in a Monotone Subdivision
• Point Location in Incremental Planar 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)