Minimal Simple Pairs in the Cubic Grid
From MaRDI portal
Publication:5458884
DOI10.1007/978-3-540-79126-3_16zbMATH Open1138.68611OpenAlexW1773943461MaRDI QIDQ5458884FDOQ5458884
Authors: Nicolas Passat, Michel Couprie, Gilles Bertrand 
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
Recommendations
Cites Work
- Connectivity in Digital Pictures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
- A concise characterization of 3D simple points
- On critical kernels
- Title not available (Why is that?)
- Minimal non-simple sets in 4D binary images
- Title not available (Why is that?)
- Title not available (Why is that?)
- A New 3D Parallel Thinning Scheme Based on Critical Kernels
- Minimal Simple Pairs in the Cubic Grid
Cited In (8)
- On 2-dimensional simple sets in \(n\)-dimensional cubic grids
- Minimal Simple Pairs in the Cubic Grid
- New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces
- A note on 3-D simple points and simple-equivalence
- Characterizations of simple points on the body-centered cubic grid
- Forming all pairs in a minimal number of steps
- Combinatorial Image Analysis
- Minimal Simple Pairs in the 3-D Cubic Grid
This page was built for publication: Minimal Simple Pairs in the Cubic Grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458884)
