Minimal non-deletable sets and minimal non-codeletable sets in binary images
From MaRDI portal
Publication:952465
DOI10.1016/j.tcs.2008.02.001zbMath1160.68048MaRDI QIDQ952465
Publication date: 12 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.001
thinning; binary image; polytopal complex; digital topology; simple; 4D; codeletable; cosimple; deletable; minimal non-deletable; minimal non-simple
68U10: Computing methodologies for image processing
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels, Topological properties of thinning in 2-D pseudomanifolds, Characterization of the deletion of \((26, 6)\)-simple points as multivalued \((\mathcal{N}, 26)\)-retractions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strongly normal sets of contractible tiles in \(n\) dimensions
- The clique complex and hypergraph matching
- A topological characterization of thinning
- Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
- Tests for connectivity preservation for parallel reduction operators
- Geometry of digital spaces
- Characterizations of Simply-Connected Finite Polyhedra in 3-Space
- A characterization of parallel thinning algorithms
- A 3D 6-subiteration thinning algorithm for extracting medial lines
- Lectures on Polytopes
- Minimal non-simple sets in 4D binary images
- Parallel Thinning Algorithms on 3D (18, 6) Binary Images
- Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes
- Combinatorial Image Analysis
