A practical divide-and-conquer algorithm for the rectangle intersection problem
- 31 July 1987
- journal article
- Published by Elsevier in Information Sciences
- Vol. 42 (2), 95-112
- https://doi.org/10.1016/0020-0255(87)90018-1
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Space-economical plane-sweep algorithmsComputer Vision, Graphics, and Image Processing, 1986
- Batched dynamic solutions to decomposable searching problemsJournal of Algorithms, 1985
- Priority Search TreesSIAM Journal on Computing, 1985
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectanglesActa Informatica, 1984
- Finding Rectangle Intersections by Divide-and-ConquerIEEE Transactions on Computers, 1984
- A new approach to rectangle intersectionsInternational Journal of Computer Mathematics, 1983
- The rectangle intersection problem revisitedBIT Numerical Mathematics, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980