The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - July-September (2001 vol.7)
pp: 195-206
ABSTRACT
<p><b>Abstract</b>—This paper introduces a refined general definition of a skeleton that is based on a penalized-distance function and cannot create any of the degenerate cases of the earlier C<scp>easar</scp> and T<scp>easar</scp> algorithms. Additionally, we provide an algorithm that finds the skeleton accurately and rapidly. Our solution is fully automatic, which frees the user from having to engage in manual data preprocessing. We present the accurate skeletons computed on a number of test datasets. The algorithm is very efficient as demonstrated by the running times which were all below seven minutes.</p>
INDEX TERMS
Skeleton, centerline, medial axis, automatic preprocessing, modeling.
CITATION
Ingmar Bitter, Arie E. Kaufman, Mie Sato, "Penalized-Distance Volumetric Skeleton Algorithm", IEEE Transactions on Visualization & Computer Graphics, vol.7, no. 3, pp. 195-206, July-September 2001, doi:10.1109/2945.942688
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool