Region representation
- 1 March 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 23 (3), 171-179
- https://doi.org/10.1145/358826.358838
Abstract
There has been recent interest in the use of quadtrees to represent regions in an image. It thus becomes desirable to develop efficient methods of conversion between quadtrees and other types of region representations. This paper presents an algorithm for converting from quadtrees to a simple class of boundary codes. The algorithm is shown to have an execution time proportional to the perimeter of the region.This publication has 16 references indexed in Scilit:
- Region representationCommunications of the ACM, 1980
- Linear transformation of pictures represented by quad treesComputer Graphics and Image Processing, 1979
- Picture decomposition, tree data-structures, and identifying directional symmetries as node combinationsComputer Graphics and Image Processing, 1978
- Computational techniques in the visual segmentation of static scenesComputer Graphics and Image Processing, 1977
- Picture Segmentation by a Tree Traversal AlgorithmJournal of the ACM, 1976
- A hierarchical data structure for picture processingComputer Graphics and Image Processing, 1975
- Computer Processing of Line-Drawing ImagesACM Computing Surveys, 1974
- Computer representation of planar regions by their skeletonsCommunications of the ACM, 1967
- Sequential Operations in Digital Picture ProcessingJournal of the ACM, 1966
- Report on the algorithmic language ALGOL 60Communications of the ACM, 1960