The Community for Technology Leaders
Green Image
<p>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.</p>
Euler number; geometric properties; binary images; linear quadtree; threaded linear hierarchical quadtree; TLHQT; adjacencies; structure; adjacency links; labeling connected components; perimeter; quadtree environment; computational geometry; computerised picture processing; data structures

P. Shankar, A. Unnikrishnan and Y. Venkatesh, "Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images," in IEEE Transactions on Software Engineering, vol. 14, no. , pp. 659-665, 1988.
88 ms
(Ver 3.3 (11022016))