Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes

DOI10.1007/11907350_15MaRDI QIDQ5386019zbMATH OpenOpenAlexFDO

Authors T. Yung Kong

Publication date 17 April 2008

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

Full work available at URL https://doi.org/10.1007/11907350_15

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial Image Analysis
• Minimal non-deletable sets and minimal non-codeletable sets in binary images
• On 2-dimensional simple sets in \(n\)-dimensional cubic grids
• Minimal Simple Pairs in the 3-D Cubic Grid
• New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces

Cited in

(6)

• On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
• New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces
• Powerful parallel and symmetric 3D thinning schemes based on critical kernels
• Minimal non-deletable sets and minimal non-codeletable sets in binary images
• scientific article; zbMATH DE number 7714764 (Why is no real title available?)
• Minimal non-simple sets in 4D binary images

This page was built for publication: Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes

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