Efficient polygonization of tree trunks modeled by convolution surfaces  

作　　者：ZHU XiaoQiang GUO XueKun JIN XiaoGang 

机构地区：[1]State Key Laboratory of CAD & CG,Zhejiang University

出　　处：《Science China(Information Sciences)》2013年第3期44-55,共12页中国科学（信息科学）（英文版）

基　　金：supported by National Key Basic Research Foundation of China(Grant No.2009CB320801);National Natural Science Foundation of China(Grant No.60933007);Zhejiang Provincial Natural Science Foundation of China(Grant No.Z1110154)

摘　　要：We present an efficient polygonization approach for tree trunks modeled by line skeleton-based convolution surfaces. A quad-dominated non-convex bounding polyhedron is firstly created along the skeleton, which is then tetrahedralized and subdivided into the pre-defined resolution. After that, the iso-surface within each tetrahedron is extracted using marching tetrahedra. Our algorithm can generate polygons with adaptive edge lengths according to the thickness of the trunk. In addition, we present an efficient CUDA-based parallel algorithm utilizing the high parallelism of the tetrahedron subdivision, the potential field calculation, and the iso-surface extraction.We present an efficient polygonization approach for tree trunks modeled by line skeleton-based convolution surfaces. A quad-dominated non-convex bounding polyhedron is firstly created along the skeleton, which is then tetrahedralized and subdivided into the pre-defined resolution. After that, the iso-surface within each tetrahedron is extracted using marching tetrahedra. Our algorithm can generate polygons with adaptive edge lengths according to the thickness of the trunk. In addition, we present an efficient CUDA-based parallel algorithm utilizing the high parallelism of the tetrahedron subdivision, the potential field calculation, and the iso-surface extraction.

关 键 词：trunk modeling skeleton-based modeling convolution surface tetrahedral subdivision CUDA 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术] S436.6[自动化与计算机技术—计算机科学与技术]