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

DOI10.1016/J.TCS.2008.02.001zbMATH Open1160.68048OpenAlexW2086995930MaRDI QIDQ952465FDOQ952465

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

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

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)

Cites Work

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

Cited In (10)

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

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)