| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9655146 | Discrete Applied Mathematics | 2005 | 31 Pages |
Abstract
In this paper, by applying this methodology, we propose a 6-subiteration curve thinning algorithm which deletes at least all the points removed by two 6-subiteration curve thinning algorithms: either the one proposed by Palágyi and Kuba [A 3D 6-subiteration thinning algorithm for extracting medial lines, Pattern Recogn. Lett. 19(7) (1998) 613-627.], or the one proposed by Gong and Bertrand [A simple parallel 3D thinning algorithm, in: International Conference on Pattern Recognition, Atlantic City, NJ, USA, 1990, pp. 188-190.].
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Christophe Lohou, Gilles Bertrand,