License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2019.52
URN: urn:nbn:de:0030-drops-104566
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10456/
Munro, J. Ian ;
Nekrich, Yakov
Dynamic Planar Point Location in External Memory
Abstract
In this paper we describe a fully-dynamic data structure for the planar point location problem in the external memory model. Our data structure supports queries in O(log_B n(log log_B n)^3)) I/Os and updates in O(log_B n(log log_B n)^2)) amortized I/Os, where n is the number of segments in the subdivision and B is the block size. This is the first dynamic data structure with almost-optimal query cost. For comparison all previously known results for this problem require O(log_B^2 n) I/Os to answer queries. Our result almost matches the best known upper bound in the internal-memory model.
BibTeX - Entry
@InProceedings{munro_et_al:LIPIcs:2019:10456,
author = {J. Ian Munro and Yakov Nekrich},
title = {{Dynamic Planar Point Location in External Memory}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {52:1--52:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Gill Barequet and Yusu Wang},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10456},
URN = {urn:nbn:de:0030-drops-104566},
doi = {10.4230/LIPIcs.SoCG.2019.52},
annote = {Keywords: Data Structures, Dynamic Data Structures, Planar Point Location, External Memory}
}
|
Keywords: |
|
Data Structures, Dynamic Data Structures, Planar Point Location, External Memory |
|
Collection: |
|
35th International Symposium on Computational Geometry (SoCG 2019) |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
11.06.2019 |
