4D minimal non-simple sets

DOI10.1007/3-540-45986-3_7MaRDI QIDQ4738248zbMATH OpenFDO

Authors Chyi-Jou Gau, T. Yung Kong

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2301/23010081.htm

zbMATH Keywords

4D xelattachmentminimal non-simple setsMNSparallel thinning

Mathematics Subject Classification ID

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

Recommendations

• Minimal non-simple sets in 4D binary images
• Minimal non-simple sets in 4-dimensional binary images with (8,80)-adjacency
• Minimal non-deletable sets and minimal non-codeletable sets in binary images
• On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
• Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images

Cited in

(7)

• On the evolution of vector distance functions of closed curves
• An Atriodic Simple-4-OD-Like Continuum Which is Not Simple-Triod-Like
• scientific article; zbMATH DE number 16280 (Why is no real title available?)
• Minimal non-simple sets in 4D binary images
• Counting minimal reactions with specific conditions in \(\mathbb R^4\)
• Minimal non-simple sets in 4-dimensional binary images with (8,80)-adjacency
• Minimal non-deletable sets and minimal non-codeletable sets in binary images

This page was built for publication: 4D minimal non-simple sets

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