In-place algorithm for erasing a connected component in a binary image

DOI10.1007/s00224-011-9335-6zbMath1253.68344OpenAlexW2028366103MaRDI QIDQ692939

Tetsuo Asano

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-011-9335-6

zbMATH Keywords

connectivitybinary imagecomponentconstant work space

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10)

Related Items (1)

A new algorithmic framework for basic problems on binary images

Cites Work

• Unnamed Item
• On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
• Finding Nearest Larger Neighbors
• AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
• Towards in-place geometric algorithms and data structures
• In-Place Algorithm for Image Rotation
• Connectivity in Digital Pictures

This page was built for publication: In-place algorithm for erasing a connected component in a binary image