Connected Component Labeling Using Quadtrees

DOI10.1145/322261.322267zbMath0462.68070DBLPjournals/jacm/Samet81OpenAlexW2020167157WikidataQ56340282 ScholiaQ56340282MaRDI QIDQ3912065

Hanan Samet

Publication date: 1981

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322261.322267

zbMATH Keywords

image processingconnectivity

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (7)

Path-length distances for quadtrees ⋮ Detection of connectivity for regions represented by linear quadtrees ⋮ A new algorithmic framework for basic problems on binary images ⋮ Efficient boundary extraction from orthogonal pseudo-polytopes: an approach based on the \(n\)D-EVM ⋮ Fast connected-component labeling ⋮ Extended octtree representation of free form surfaces ⋮ Properties and applications of forests of quadtrees for pictorial data representation

This page was built for publication: Connected Component Labeling Using Quadtrees