A data structure and algorithm based on a linear key for a rectangle retrieval problem
- 1 October 1983
- journal article
- Published by Elsevier in Computer Vision, Graphics, and Image Processing
- Vol. 24 (1) , 1-13
- https://doi.org/10.1016/0734-189x(83)90017-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Calculations of geometric properties using quadtreesComputer Graphics and Image Processing, 1981
- Data structures for the rectangle containment and enclosure problemsComputer Graphics and Image Processing, 1980
- 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
- Region representationCommunications of the ACM, 1980
- Region representationCommunications of the ACM, 1980
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Operations on Images Using Quad TreesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- Organization and Access of Image Data by AreasPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975