Space-economical plane-sweep algorithms
- 30 April 1986
- journal article
- Published by Elsevier in Computer Vision, Graphics, and Image Processing
- Vol. 34 (1) , 35-51
- https://doi.org/10.1016/0734-189x(86)90046-0
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A worst-case efficient algorithm for hidden-line elimination†International Journal of Computer Mathematics, 1985
- Optimal algorithms to compute the closure of a set of iso-rectanglesJournal of Algorithms, 1984
- Computing the connected components of simple rectilinear geometrical objects in $d$-spaceRAIRO. Informatique théorique, 1984
- On translating a set of line segmentsComputer Vision, Graphics, and Image Processing, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Comments on “algorithms for reporting and counting geometric intersections”IEEE Transactions on Computers, 1981
- Finding the contour of a union of iso-oriented rectangiesJournal of Algorithms, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Decomposable searching problemsInformation Processing Letters, 1979