Data structures for the rectangle containment and enclosure problems
Authors:
- Vijay VaishnaviVVVijay Vaishnavi
- Derick WoodDWDerick Wood
- 1 August 1980
- journal article
- Published by Elsevier in Computer Graphics and Image Processing
- Vol. 13 (4) , 372-384
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Space and time optimal algorithms for a class of rectangle intersection problemsInformation Sciences, 1980
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Complexity of Combinatorial AlgorithmsSIAM Review, 1978
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974