Efficient dynamic algorithms for some geometric intersection problems
SW Cheng, R Janardan - Information Processing Letters, 1990 - Elsevier
Efficient dynamic algorithms are presented for four geometric intersection problems. These
include:(1) reporting the subset of a set S of nonintersecting segments in the plane that are
intersected by a query segment of fixed slope;(2) reporting the segments of S that are
intersected by a query segment whose supporting line passes through a fixed point;(3) the
orthogonal segment intersection search problem; and (4) the point enclosure problem for
isothetic hyper-rectangles in d-dimensional space, d⩾ 2. These algorithms are the first linear …
include:(1) reporting the subset of a set S of nonintersecting segments in the plane that are
intersected by a query segment of fixed slope;(2) reporting the segments of S that are
intersected by a query segment whose supporting line passes through a fixed point;(3) the
orthogonal segment intersection search problem; and (4) the point enclosure problem for
isothetic hyper-rectangles in d-dimensional space, d⩾ 2. These algorithms are the first linear …
Showing the best result for this search. See all results