On the equivalence of some rectangle problems
Authors:
- Herbert EdelsbrunnerHEHerbert Edelsbrunner
- Mark H. OvermarsMOMark H. Overmars
- 16 May 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 14 (3) , 124-127
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Finding intersection of rectangles by range searchJournal of Algorithms, 1981
- On the intersection of Orthogonal objectsInformation Processing Letters, 1981
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- Worst-case optimal insertion and deletion methods for decomposable searching problemsInformation Processing Letters, 1981
- Multidimensional divide-and-conquerCommunications of the ACM, 1980