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].
CITATION STYLE
Lohou, C., & Bertrand, G. (2002). A New 3D 6-subiteration thinning algorithm based on P-simple points. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2301, pp. 102–113). Springer Verlag. https://doi.org/10.1007/3-540-45986-3_9
Mendeley helps you to discover research relevant for your work.