A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
Journal of the ACM
An improved and general approach to connected-component labeling of images is presented. The algorithm presented in this paper processes images in predeterttuned order, which means that the processing order depends only on the image representation scheme and not on specific properties of the image. The algorithm handles a wide variety of image representation schemes (rasters, run lengths, quadtrees, bintrees, etc.). How to adapt the standard UNION-FIND algorithm to permit reuse ofdoi:10.1145/128749.128750 fatcat:wm3zp2fyyngvlgalco3rc5gqja