Region representation
Charles R. Dyer, Azriel Rosenfeld, Hanan Samet · Communications of the ACM · 1980
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.
Cited by 144 works. doi:10.1145/358826.358838 Open-access PDF
Authors
References
- Report on the algorithmic language ALGOL 60
- Sequential Operations in Digital Picture Processing
- Quad trees a data structure for retrieval on composite keys
- Revised report on the algorithmic language ALGOL 60
- A transformation for extracting new descriptors of shape
- A hierarchical data structure for picture processing
- Computer Processing of Line-Drawing Images
- Models for the perception of speech and visual form
- Computer representation of planar regions by their skeletons
- Experiments on picture representation using regular decomposition