New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces

DOI10.1007/978-3-540-79126-3_11zbMath1138.68588OpenAlexW1585007175MaRDI QIDQ5458878

Michel Couprie, Gilles Bertrand

Publication date: 24 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79126-3_11

Mathematics Subject Classification ID

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

Related Items

Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model ⋮ New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
• Tests for connectivity preservation for parallel reduction operators
• A 3D 12-subiteration thinning algorithm based on \(P\)-simple points
• Strong thinning and polyhedric approximation of the surface of a voxel object
• On critical kernels
• A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
• Minimal non-simple sets in 4D binary images
• Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes
• A New 3D Parallel Thinning Scheme Based on Critical Kernels
• New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces
• Minimal Simple Pairs in the Cubic Grid
• Combinatorial Image Analysis

This page was built for publication: New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces