Connected component labelling using quadtrees—a bottom-up approach
The Computer Journal
Optimal quadtree construction algorithms
Computer Vision, Graphics, and Image Processing
Distribution of black nodes at various levels in a linear quadtree
Pattern Recognition Letters
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Connected Component Labeling Using Quadtrees
Journal of the ACM (JACM)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
An effective way to represent quadtrees
Communications of the ACM
| Hi-index | 0.00 |
A modification of the linear quadtree, the threaded linear hierarchical quadtree (TLHQT), is proposed for the computation of geometric properties of binary images. Since most of the algorithms used in connection with computation of geometric properties require frequent exploration of adjacencies, a structure that keeps permanently in memory some adjacency links is introduced. Some results obtained by using the TLHQT for labeling connected components and for evaluating the perimeter and Euler's number in a quadtree environment are presented. The performance of the TLHQT is discussed.