A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
From MaRDI portal
Publication:2573247
DOI10.1016/j.dam.2005.02.030zbMath1105.68108OpenAlexW2014597880MaRDI QIDQ2573247
Gilles Bertrand, Christophe Lohou
Publication date: 7 November 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.02.030
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Two symmetrical thinning algorithms for 3D binary images, based on \(P\)-simple points, A 3D Sequential Thinning Scheme Based on Critical Kernels, A new relative chain code in 3D, Topologically robust CAD model generation for structural optimisation, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A topological characterization of thinning
- Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
- A 3D 12-subiteration thinning algorithm based on \(P\)-simple points
- Strong thinning and polyhedric approximation of the surface of a voxel object
- Some topological properties of surfaces in \(Z^3\)
- Two 3D symmetrical thinning algorithms based on P-simple points
- Graph-Based Algorithms for Boolean Function Manipulation
- A characterization of parallel thinning algorithms
- A 3D 6-subiteration thinning algorithm for extracting medial lines
- Fast Binary Image Processing Using Binary Decision Diagrams
- A new characterization of three-dimensional simple points
- A New 3D 12-Subiteration Thinning Algorithm Based on P-Simple Points