I/O-efficient dynamic planar point location (extended abstract)

DOI10.1145/336154.336205zbMath1373.68186OpenAlexW1968254683MaRDI QIDQ5361530

Lars Arge, Jan Vahrenhold

Publication date: 29 September 2017

Published in: Proceedings of the sixteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/336154.336205

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (2)

I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions ⋮ I/O-efficient point location using persistent B-trees

This page was built for publication: I/O-efficient dynamic planar point location (extended abstract)