A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Detection of connectivity for regions represented by linear quadtrees
1982
Computers and Mathematics with Applications
An algorithm is given for the determination of all connected components of a given region. The data structure used to represent the region (or image) is the linear quadtree, a recently introduced structure which basically consists of a sorted array of quaternary integers. A linear quadtree is built in a way similar to that of a regular quadtree but contains, as elements, only black nodes. The proposed algorithm has computational complexity proportional to 12nN. where n is the resolution
doi:10.1016/0898-1221(82)90014-1
fatcat:liztrnd6tzhwhnf6imtweds72m