TY - JOUR
T1 - Curve-skeleton extraction using iterative least squares optimization
AU - Wang, Yu Shuen
AU - Lee, Tong Yee
N1 - Funding Information:
The authors would like to thank Dey and Sun [14] for providing their open software and for helping with the experimental comparisons between their methods and the methods presented in this paper. The authors would also like to thank the anonymous reviewers for helping in the improvement of this paper. This work is supported by the Landmark Program of the NCKU Top University Project under Contract B0008 and is supported in part by the National Science Council under Contracts NSC-95-2221-E-006-193-MY2 and NSC-96-2628-E-006-200-MY3.
PY - 2008/7
Y1 - 2008/7
N2 - A curve skeleton is a compact representation of 3D objects and has numerous applications. It can be used to describe an object's geometry and topology. In this paper, we introduce a novel approach for computing curve skeletons for volumetric representations of the input models. Our algorithm consists of three major steps: 1 ) using iterative least squares optimization to shrink models and, at the same time, preserving their geometries and topologies, 2) extracting curve skeletons through the thinning algorithm, and 3) pruning unnecessary branches based on shrinking ratios. The proposed method is less sensitive to noise on the surface of models and can generate smoother skeletons. In addition, our shrinking algorithm requires little computation, since the optimization system can be factorized and stored in the precomputational step. We demonstrate several extracted skeletons that help evaluate our algorithm. We also experimentally compare the proposed method with other well-known methods. Experimental results show advantages when using our method over other techniques.
AB - A curve skeleton is a compact representation of 3D objects and has numerous applications. It can be used to describe an object's geometry and topology. In this paper, we introduce a novel approach for computing curve skeletons for volumetric representations of the input models. Our algorithm consists of three major steps: 1 ) using iterative least squares optimization to shrink models and, at the same time, preserving their geometries and topologies, 2) extracting curve skeletons through the thinning algorithm, and 3) pruning unnecessary branches based on shrinking ratios. The proposed method is less sensitive to noise on the surface of models and can generate smoother skeletons. In addition, our shrinking algorithm requires little computation, since the optimization system can be factorized and stored in the precomputational step. We demonstrate several extracted skeletons that help evaluate our algorithm. We also experimentally compare the proposed method with other well-known methods. Experimental results show advantages when using our method over other techniques.
UR - http://www.scopus.com/inward/record.url?scp=44649132615&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=44649132615&partnerID=8YFLogxK
U2 - 10.1109/TVCG.2008.38
DO - 10.1109/TVCG.2008.38
M3 - Article
C2 - 18467765
AN - SCOPUS:44649132615
SN - 1077-2626
VL - 14
SP - 926
EP - 936
JO - IEEE Transactions on Visualization and Computer Graphics
JF - IEEE Transactions on Visualization and Computer Graphics
IS - 4
M1 - 4459323
ER -