A simple parallel 3D thinning algorithm

Abstract

A parallel 3-D thinning algorithm which conserves medial surfaces is presented. A new characterization of simple points is proposed and some new topological predicates are given which are very simple to calculate. Some new geometrical predicates are also given. It is proved that the thinning operation based on those new predicates does not disconnect a 3-D object. Experiments show that the method gives a satisfactory result.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>