Minimal non-deletable sets and minimal non-codeletable sets in binary images

DOI10.1016/J.TCS.2008.02.001MaRDI QIDQ952465zbMATH OpenOpenAlexFDO

Authors T. Yung Kong

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

zbMATH Keywords

digital topologysimplethinningpolytopal complexbinary image4Dcodeletablecosimpledeletableminimal non-deletableminimal non-simple

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
• Minimal non-simple sets in 4D binary images
• Combinatorial Image Analysis
• scientific article; zbMATH DE number 2087453
• A topological characterization of thinning

Cites work

• scientific article; zbMATH DE number 3812514 (Why is no real title available?)
• scientific article; zbMATH DE number 3900665 (Why is no real title available?)
• scientific article; zbMATH DE number 3678765 (Why is no real title available?)
• scientific article; zbMATH DE number 3544865 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• scientific article; zbMATH DE number 850888 (Why is no real title available?)
• scientific article; zbMATH DE number 863503 (Why is no real title available?)
• A 3D 6-subiteration thinning algorithm for extracting medial lines
• A characterization of parallel thinning algorithms
• A topological characterization of thinning
• Characterizations of Simply-Connected Finite Polyhedra in 3-Space
• Combinatorial Image Analysis
• Geometry of digital spaces
• Lectures on Polytopes
• Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes
• Minimal non-simple sets in 4D binary images
• Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
• Parallel Thinning Algorithms on 3D (18, 6) Binary Images
• Strongly normal sets of contractible tiles in \(n\) dimensions
• Tests for connectivity preservation for parallel reduction operators
• The clique complex and hypergraph matching

Cited in

(10)

• On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
• Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes
• scientific article; zbMATH DE number 2087453 (Why is no real title available?)
• Non-expandable non-overlapping sets of pictures
• scientific article; zbMATH DE number 7714764 (Why is no real title available?)
• Minimal non-simple sets in 4D binary images
• Characterization of the deletion of \((26, 6)\)-simple points as multivalued \((\mathcal{N}, 26)\)-retractions
• Combinatorial Image Analysis
• Topological properties of thinning in 2-D pseudomanifolds
• Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images

This page was built for publication: Minimal non-deletable sets and minimal non-codeletable sets in binary images

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