Penalized-distance volumetric skeleton algorithm

摘要

Introduces a refined general definition of a skeleton that isnbased on a penalized distance function and that cannot create any of thendegenerate cases of the earlier CEASAR (Center-line ExtractionnAlgorithm-Smooth, Accurate and Robust) and TEASAR (Tree-structurenExtraction Algorithm for Skeletons-Accurate and Robust) algorithms.nAdditionally, we provide an algorithm that finds the skeleton accuratelynand rapidly. Our solution is fully automatic, which frees the user fromnhaving to engage in manual data pre-processing. We present the accuratenskeletons computed on a number of test data sets. The algorithm is verynefficient, as demonstrated by the running times, which were all belownseven minutes