LIPIcs.SoCG.2017.30.pdf
- Filesize: 0.53 MB
- 15 pages
Document
Adaptive Planar Point Location
Authors
-
Part of:
Volume:
33rd International Symposium on Computational Geometry (SoCG 2017)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Computational Geometry (SoCG) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2017-06-20
Cite AsGet BibTex
Siu-Wing Cheng and Man-Kit Lau. Adaptive Planar Point Location. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.SoCG.2017.30
https://doi.org/10.4230/LIPIcs.SoCG.2017.30
Abstract
We present a self-adjusting point location structure for convex subdivisions. Let n be the number of vertices in a convex subdivision S. Our structure for S uses O(n) space and processes any online query sequence sigma in O(n + OPT) time, where OPT is the minimum time required by any linear decision tree for answering point location queries in S to process sigma. The O(n + OPT) time bound includes the preprocessing time. Our result is a two-dimensional analog of the static optimality property of splay trees. For connected subdivisions, we achieve a processing time of O(|sigma| log log n + n + OPT).
Keywords
- point location
- planar subdivision
- static optimality
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads