Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2019.58
URN: urn:nbn:de:0030-drops-115548
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11554/
Iacono, John ; Karsin, Ben ; Koumoutsos, Grigorios
External Memory Planar Point Location with Fast Updates
| pdf-format: |
|
Abstract
We study dynamic planar point location in the External Memory Model or Disk Access Model (DAM). Previous work in this model achieves polylog query and polylog amortized update time. We present a data structure with O(log_B^2 N) query time and O(1/B^(1-epsilon) log_B N) amortized update time, where N is the number of segments, B the block size and epsilon is a small positive constant, under the assumption that all faces have constant size. This is a B^(1-epsilon) factor faster for updates than the fastest previous structure, and brings the cost of insertion and deletion down to subconstant amortized time for reasonable choices of N and B. Our structure solves the problem of vertical ray-shooting queries among a dynamic set of interior-disjoint line segments; this is well-known to solve dynamic planar point location for a connected subdivision of the plane with faces of constant size.
BibTeX - Entry
@InProceedings{iacono_et_al:LIPIcs:2019:11554,
author = {John Iacono and Ben Karsin and Grigorios Koumoutsos},
title = {{External Memory Planar Point Location with Fast Updates}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {58:1--58:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Pinyan Lu and Guochuan Zhang},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11554},
URN = {urn:nbn:de:0030-drops-115548},
doi = {10.4230/LIPIcs.ISAAC.2019.58},
annote = {Keywords: point location, data structures, dynamic algorithms, computational geometry}
}
| Keywords: | point location, data structures, dynamic algorithms, computational geometry | |
| Seminar: | 30th International Symposium on Algorithms and Computation (ISAAC 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 28.11.2019 |
