Counting regions, holes, and their nesting level in time proportional to the border
From MaRDI portal
Publication:3759963
DOI10.1016/0734-189X(85)90118-5zbMath0622.68077OpenAlexW2091839782MaRDI QIDQ3759963
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
algorithmpattern recognitionimage processingphototypesettingseparation of components in a pixel-based environment
Related Items
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