Dynamic planar point location in optimal time
Document Type
Conference Proceeding
Publication Date
6-15-2021
Department
Department of Computer Science
Abstract
In this paper we describe a fully-dynamic data structure that supports point location queries in a connected planar subdivision with n edges. Our data structure uses O(n) space, answers queries in O(logn) time, and supports updates in O(logn) time. Our solution is based on a data structure for vertical ray shooting queries that supports queries and updates in O(logn) time.
Publication Title
Proceedings of the Annual ACM Symposium on Theory of Computing
ISBN
9781450380539
Recommended Citation
Nekrich, Y.
(2021).
Dynamic planar point location in optimal time.
Proceedings of the Annual ACM Symposium on Theory of Computing, 1003-1014.
http://doi.org/10.1145/3406325.3451100
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/14998