Minimal Simple Pairs in the Cubic Grid

DOI10.1007/978-3-540-79126-3_16zbMath1138.68611OpenAlexW1773943461MaRDI QIDQ5458884

Gilles Bertrand, Michel Couprie, Nicolas Passat

Publication date: 24 April 2008

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79126-3_16

zbMATH Keywords

collapsethinningtopology preservationcubical complexes3-D space

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

A note on 3-D simple points and simple-equivalence ⋮ New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces ⋮ Minimal Simple Pairs in the Cubic Grid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
• A concise characterization of 3D simple points
• On critical kernels
• Minimal non-simple sets in 4D binary images
• A New 3D Parallel Thinning Scheme Based on Critical Kernels
• Minimal Simple Pairs in the Cubic Grid
• Connectivity in Digital Pictures

This page was built for publication: Minimal Simple Pairs in the Cubic Grid