scientific article; zbMATH DE number 7236467

DOI10.4230/LIPIcs.SoCG.2018.63zbMath1489.68370arXiv1803.04325MaRDI QIDQ5116523

Hee-Kap Ahn, Eunjin Oh

Publication date: 18 August 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic point locationgeneral subdivision

Mathematics Subject Classification ID

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

Related Items

Point Location in Incremental Planar Subdivisions.

Cites Work

• Worst-case optimal insertion and deletion methods for decomposable searching problems
• Efficient partition trees
• Decomposable searching problems I. Static-to-dynamic transformation
• New Results on Dynamic Planar Point Location
• Efficiency of a Good But Not Linear Set Union Algorithm
• Dynamic Point Location in General Subdivisions
• Towards an Optimal Method for Dynamic Planar Point Location
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item