Space and Time Efficient Virtual Quadtress
- 1 March 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. PAMI-6 (2) , 244-247
- https://doi.org/10.1109/tpami.1984.4767508
Abstract
The quadtree has recently become a major data structure in image processing. This correspondence investigates ways in which quadtrees may be efficiently stored as a forest of quadtrees and as a new structure we call a compact quadtree. These new structures are called virtual quadtrees because the basic operations we expect to perform in moving about within a quadtree can also be performed on the new representations. Space and time efficiency are investigated and it is shown these new structures often given an improvement in both.Keywords
This publication has 10 references indexed in Scilit:
- Contour FillingPublished by Springer Nature ,1982
- Connected Component Labeling Using QuadtreesJournal of the ACM, 1981
- An Algorithm for Converting Rasters to QuadtreesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Region representation: Quadtrees from binary arraysComputer Graphics and Image Processing, 1980
- Region representationCommunications of the ACM, 1980
- Region representationCommunications of the ACM, 1980
- Operations on Images Using Quad TreesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- Picture decomposition, tree data-structures, and identifying directional symmetries as node combinationsComputer Graphics and Image Processing, 1978
- The Use of Algorithms of Piecewise Approximations for Picture Processing ApplicationsACM Transactions on Mathematical Software, 1976
- Experiments on picture representation using regular decompositionComputer Graphics and Image Processing, 1976