Time- and space-optimal contour computation for a set of rectangles
- 16 March 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 24 (5) , 335-338
- https://doi.org/10.1016/0020-0190(87)90159-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The contour problem for rectilinear polygonsInformation Processing Letters, 1984
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectanglesActa Informatica, 1984
- An optimal contour algorithm for iso-oriented rectanglesJournal of Algorithms, 1984
- Computing the connected components of simple rectilinear geometrical objects in $d$-spaceRAIRO. Informatique théorique, 1984
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Finding the contour of a union of iso-oriented rectangiesJournal of Algorithms, 1980