Region representation
Hanan Samet · Communications of the ACM · 1980
An algorithm is presented for constructing a quadtree for a region given its boundary in the form of a chain code. Analysis of the algorithm reveals that its execution time is proportional to the product of the perimeter and the log of the diameter of the region.
Cited by 174 works. doi:10.1145/358826.358836 Open-access PDF
Authors
References
- Report on the algorithmic language ALGOL 60
- Revised report on the algorithmic language ALGOL 60
- Operations on Images Using Quad Trees
- Region representation
- Efficient computation and data structures for graphics.
- Organization and Access of Image Data by Areas
- An Algorithm for Converting Rasters to Quadtrees
- Linear transformation of pictures represented by quad trees
- Algorithms for the Conversion of Quadtrees to Rasters