Affiliation:
1. Department of Computer Science, Brown University, Providence, R.I. 02912–1910, U.S.A.
Abstract
We present a fully dynamic data structure for point location in a monotone subdivision, based on the trapezoid method. The operations supported are insertion and deletion of vertices and edges, and horizontal translation of vertices. Let n be the current number of vertices of the subdivision. Point location queries take O( log n) time, while updates take O ( log 2 n) time (amortized for vertex insertion/deletion and worst-case for the other updates). The space requirement is O(n log n). This is the first fully dynamic point location data structure for monotone subdivisions that achieves optimal query time.
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dynamic Distribution-Sensitive Point Location;ACM Transactions on Algorithms;2022-01-31
2. Dynamic planar point location in optimal time;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
3. Towards an Optimal Method for Dynamic Planar Point Location;SIAM Journal on Computing;2018-01
4. Towards an Optimal Method for Dynamic Planar Point Location;2015 IEEE 56th Annual Symposium on Foundations of Computer Science;2015-10
5. Optimal dynamic vertical ray shooting in rectilinear planar subdivisions;ACM Transactions on Algorithms;2009-07