A New 3D 6-Subiteration Thinning Algorithm Based on P-Simple Points

In a recent study [1], we proposed a new methodology to build thinning algorithms based on the deletion of P-simple points. This methodology may permit to conceive a thinning algorithm A′ from an existent thinning algorithm A, such that A′ deletes at least all the points removed by A, while preserving the same end points. In this paper, by applying this methodology, we propose a new 6-subiteration thinning algorithm which deletes at least all the points removed by the 6-subiteration thinning algorithm proposed by Palágyi and Kuba [2].