Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
- 1 October 1984
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 21 (3) , 271-291
- https://doi.org/10.1007/bf00264251
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Finding Rectangle Intersections by Divide-and-ConquerIEEE Transactions on Computers, 1984
- 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
- 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
- Geometric intersection problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976