TY - GEN
T1 - Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
AU - Giyora, Yoav
AU - Kaplan, Haim
N1 - Publisher Copyright:
Copyright © 2007 by the Association for Computing Machinery, Inc. and the Society for Industrial and Applied Mathematics.
PY - 2007
Y1 - 2007
N2 - In this paper we consider the dynamic vertical ray shooting problem, that is the task of maintaining a dynamic set S of n non intersecting horizontal line segments in the plane subject to a query that reports the first segment in S intersecting a vertical ray from a query point. We develop a linearsize structure that supports queries, insertions and deletions in O(log n) worst-case time. Our structure works in the comparison model and uses a RAM.
AB - In this paper we consider the dynamic vertical ray shooting problem, that is the task of maintaining a dynamic set S of n non intersecting horizontal line segments in the plane subject to a query that reports the first segment in S intersecting a vertical ray from a query point. We develop a linearsize structure that supports queries, insertions and deletions in O(log n) worst-case time. Our structure works in the comparison model and uses a RAM.
UR - http://www.scopus.com/inward/record.url?scp=68549086203&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:68549086203
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 19
EP - 28
BT - Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
PB - Association for Computing Machinery
Y2 - 7 January 2007 through 9 January 2007
ER -