Dynamic Ray Stabbing
ACM Transactions on Algorithms(2014)
摘要
We consider maintaining a dynamic set S of N horizontal segments in ℝ2 such that, given a vertical ray Q in ℝ2, the segments in S intersecting Q can be reported efficiently. In the external memory model, we give a structure that consumes O(N/B) space, answers a query in O(log BN + K/B) time (where K is the number of reported segments), and can be updated in O(log BN) amortized time per insertion and deletion. With B set to a constant, the structure also works in internal memory, consuming space O(N), answering a query in O(log N + K) time, and supporting an update in O(log N) amortized time.
更多查看译文
关键词
computational geometry,pointer machines,ray stabbing,dynamic data structures,segment intersection,theory,computations on discrete structures
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络