Dynamic planar point location in optimal time
ACM Symposium on Theory of Computing(2021)
摘要
ABSTRACTIn 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.
更多查看译文
关键词
computational geometry,point location,dynamic data structures
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要