Fast dynamic intersection searching in a set of isothetic line segments
References (15)
Decomposable searching problems
Inform. Process. Lett.
(1979)- et al.
On the intersection of orthogonal objects
Inform. Process. Lett.
(1981) - et al.
Some methods of computational geometry applied to computer graphics
Computer Vision, Graphics and Image Processing
(1984) - et al.
Optimal algorithms to compute the closure of a set of iso-rectangles
J. Algorithms
(1984) Solutions to Klee's rectangle problems
(1977)- et al.
An optimal worst-case algorithm for reporting intersections of rectangles
IEEE Trans. Comput.
(1980) Filtering search: A new approach to query answering
There are more references available in the full text version of this article.
Cited by (3)
Optimal two-terminal α-β wire routing
1988, Integration, the VLSI JournalPicture processing: 1986.
1987, Computer Vision, Graphics, & Image ProcessingDynamic fractional cascading
1990, Algorithmica
Copyright © 1985 Published by Elsevier B.V.