Determining maximum \(k\)-width-connectivity on meshes

DOI10.1016/0925-7721(93)90002-NzbMath0779.68040OpenAlexW2059050311MaRDI QIDQ685604

Susanne E. Hambrusch, Frank Dehne

Publication date: 19 January 1994

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(93)90002-n

zbMATH Keywords

connected componentsbinary imagemeshes\(k\)-width-connectivity

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Parallel algorithms for determining \(k\)-width connectivity in binary images
• Solving tree problems on a mesh-connected processor array
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Parallel Image Processing by Memory-Augmented Cellular Automata
• Hypercube and shuffle-exchange algorithms for image component labeling
• Connectivity in Digital Pictures
• On shrinking binary picture patterns

This page was built for publication: Determining maximum \(k\)-width-connectivity on meshes