参数平面二叉树剖分网格简化  

Mesh Simplification Using Non-balance Binary Tree on Parameterization Plane

作　　者：关东东[1] 关华勇[1] 汪嘉业[2] 

机构地区：[1]山东大学数学与系统科学学院,济南250100 [2]山东大学计算机科学与技术学院,济南250100

出　　处：《中国图象图形学报》2006年第1期89-95,共7页Journal of Image and Graphics

摘　　要：为了快速地对3维网格模型进行简化,提出了一种曲率自适应的3维网格简化算法,该算法首先将原始网格投影至参数平面上,并构造反映原始网格曲率分布的平面曲率灰度分布,用以表征简化过程中对网格各部分不同的采样密度要求;然后根据等曲率灰度分割的原则来对参数平面进行二叉树剖分,以构造反映其不均匀分布的非均衡二叉树结构,并依此选取简化后的网格顶点集合,以构造简化的三角网格。该算法的优点是执行速度快,同时在简化过程中仍能充分保持原始网格的细节。A curvature adaptive algorithm is presented to simplify 3d meshes rapidly based on splitting of the parameterization plane. The original 3d mesh is mapped onto the parameterization plane. A planar gray-level distribution is constructed based on the curvature values of the vertices of the original mesh to proclaim the various sampling density requirements of the original mesh. An iteration algorithm is used to select the curvature adaptive resample vertices on the parametcrization plane to construct the simplified mesh. The parameterization plane is iteratively split into two parts with the same summation of the gray-level value in each step. A non-balance binary tree was constructed during the procedure of splitting. The resample vertices set is obtained by allocating one vertex in each leaf node, and those resampled vertices are triangulated to construct the simplified mesh. This algorithm is very fast and can preserve the detail very well.

关 键 词：网格简化 参数化 曲率 

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