A New 3D 12-Subiteration Thinning Algorithm Based on P-Simple Points
Christophe Lohou, Gilles Bertrand · Electronic Notes in Theoretical Computer Science · 2001
In this paper, we propose a new methodology based on P -simple points, in order to build a thinning algorithm. From an existent thinning algorithm A , we construct another thinning algorithm A’ , such that A’ deletes at least all the points removed by A , while preserving the same end points. In fact, we propose an algorithm which deletes at least the points removed by a recent 12-subiteration thinning algorithm proposed by Palágyi and Kuba [26].