TY - JOUR
T1 - Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
AU - Giora, Yoav
AU - Kaplan, Haim
PY - 2009/7/1
Y1 - 2009/7/1
N2 - We consider the dynamic vertical ray shooting problem against horizontal disjoint segments, that is, the task of maintaining a dynamic set S of n nonintersecting horizontal line segments in the plane under a query that reports the first segment in S intersecting a vertical ray from a query point. We develop a linear-size structure that supports queries, insertions, and deletion in O(log n) worst-case time. Our structure works in the comparison model on a random access machine.
AB - We consider the dynamic vertical ray shooting problem against horizontal disjoint segments, that is, the task of maintaining a dynamic set S of n nonintersecting horizontal line segments in the plane under a query that reports the first segment in S intersecting a vertical ray from a query point. We develop a linear-size structure that supports queries, insertions, and deletion in O(log n) worst-case time. Our structure works in the comparison model on a random access machine.
KW - Planar point location
KW - Ray shooting
UR - http://www.scopus.com/inward/record.url?scp=68549085218&partnerID=8YFLogxK
U2 - 10.1145/1541885.1541889
DO - 10.1145/1541885.1541889
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:68549085218
SN - 1549-6325
VL - 5
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
IS - 3
M1 - 28
ER -