Determining maximum k-width-connectivity on meshes

DOI10.1016/0925-7721(93)90002-NzbMATH Open0779.68040OpenAlexW2059050311MaRDI QIDQ685604FDOQ685604

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

Recommendations

• Parallel algorithms for determining \(k\)-width connectivity in binary images
• Parallel asynchronous connected components in a mesh
• Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
• [[:Publication:4028914|Title not available (Why is that?)]]
• Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer

zbMATH Keywords

connected componentsmeshesbinary image\(k\)-width-connectivity

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments

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

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