Results 1 
3 of
3
A new 3D 12subiteration thinning algorithm based on Psimple points
"... In this paper, we propose a new methodology based on Psimple 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, w ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper, we propose a new methodology based on Psimple 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 12subiteration thinning algorithm proposed by Palagyi and Kuba [26].
Three Dimensional Parallel Thinning Algorithms Based on Psimple Points
"... A simple point of an object is a point whose removal does not change the topology. However, the simultaneous deletion of simple points may change the topology. Through the notion of Psimple point, we give examples of algorithms, described by a twosteps procedure, which removes simple points in par ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A simple point of an object is a point whose removal does not change the topology. However, the simultaneous deletion of simple points may change the topology. Through the notion of Psimple point, we give examples of algorithms, described by a twosteps procedure, which removes simple points in parallel and which are automatically ensured to preserve the topology. More particularly, a new symmetrical thinning algorithm is proposed. Furthermore, through the notion of P^xsimple point, we give a methodology which permits to produce an algorithm A' (described by a onestep procedure) from an existent one A, which is "faster" than A, in the sense that it usually 'deletes more points than A''.