CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

authors Samet, Hanan
year 1981
title Connected Component Labeling Using Quadtrees
source Journal of the Association for Computing Machinery. July, 1981. vol. 23: pp. 487-501 : ill. includes bibliography
summary An algorithm is presented for labeling the connectedŌ h)0*0*0*°° ŌŒ components of an image represented by a quadtree. The algorithm proceeds by exploring all possible adjacencies for each node once and only once. As soon as this is done, any equivalences generated by the adjacency labeling phase are propagated. Analysis of the algorithm reveals that its average execution time is of the order O(W+B(logB)), where B and W correspond to the number of blocks comprising the foreground and background, respectively, of the image
keywords algorithms, quadtree, image processing, pattern recognition, representation
series CADline
references Content-type: text/plain
last changed 1999/02/12 14:09
HOMELOGIN (you are user _anon_494163 from group guest) Works Powered by SciX Open Publishing Services 1.002