An Algorithm for Converting Rasters to Quadtrees
Hanan Samet · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1981
An algorithm is presented for constructing a quadtree for a binary image given its row-by-row description. The algorithm processes the image one row at a time and merges identically colored sons as soon as possible, so that a minimal size quadtree exists after processing each pixel. This method is spacewise superior to one which reads in an entire array and then attempts to build the quadtree.
Cited by 120 works. doi:10.1109/tpami.1981.4767054
Authors
References
- Digital Picture Processing
- Digital Picture Processing
- Experiments on picture representation using regular decomposition
- Operations on Images Using Quad Trees
- Region representation
- Region representation
- Organization and Access of Image Data by Areas
- Region representation: Quadtrees from binary arrays
- Computing Perimeters of Images Represented by Quadtrees
- Connected Component Labeling Using Quadtrees