Two 3D symmetrical thinning algorithms based on P-simple points
From MaRDI portal
Recommendations
- Two symmetrical thinning algorithms for 3D binary images, based on \(P\)-simple points
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels
- A 3D 12-subiteration thinning algorithm based on \(P\)-simple points
- Parallel Thinning Algorithms on 3D (18, 6) Binary Images
- Isthmus-based parallel and asymmetric 3D thinning algorithms
Cites work
- A 3D 6-subiteration thinning algorithm for extracting medial lines
- A new 3D 12-subiteration thinning algorithm based on P-simple points
- scientific article; zbMATH DE number 1104449 (Why is no real title available?)
- scientific article; zbMATH DE number 2087455 (Why is no real title available?)
- scientific article; zbMATH DE number 850888 (Why is no real title available?)
- Strong thinning and polyhedric approximation of the surface of a voxel object
Cited in
(6)- A 3D 12-subiteration thinning algorithm based on \(P\)-simple points
- A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
- scientific article; zbMATH DE number 2087455 (Why is no real title available?)
- A new 3D 12-subiteration thinning algorithm based on P-simple points
- New Removal Operators for Surface Skeletonization
- Two symmetrical thinning algorithms for 3D binary images, based on \(P\)-simple points
This page was built for publication: Two 3D symmetrical thinning algorithms based on P-simple points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3438925)
