Counting regions, holes, and their nesting level in time proportional to the border

DOI10.1016/0734-189X(85)90118-5zbMATH Open0622.68077OpenAlexW2091839782MaRDI QIDQ3759963FDOQ3759963

Authors H. H. Atkinson, Irene Gargantini, Timothy R. S. Walsh 

Publication date 1985

Published in Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0734-189x(85)90118-5

zbMATH Keywords

algorithmpattern recognitionimage processingphototypesettingseparation of components in a pixel-based environment

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Cited in

(2)

• Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length
• On the size of quadtrees generalized to d-dimensional binary pictures

This page was built for publication: Counting regions, holes, and their nesting level in time proportional to the border

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3759963)