计算机工程与应用2013，Vol.49Issue(3)：182-185,189,5.DOI:10.3778/j.issn.1002-8331.1106-0495
曲率约束的隐式曲面三角网格化
Triangulation mesh of implicit surfaces with curvature constraint
摘要
Abstract
An effective algorithm for triangulation mesh of implicit surfaces is proposed. From a seed point on the surface starting, the boundary of generated mesh is considered as expanded polygon, and the point on this polygon corresponding to minimum angle is considered as expanded point. The generated triangles from expanded point can be computed, and furthermore, in order to prevent new triangles from overlapping existing triangles, collision detection must be done. In the process of triangulation mesh, due to dynamic expanded polygon, above steps are repeated until expanded polygon is empty. This algorithm is used to triangulation mesh of analytical and variational implicit surfaces respectively. The result of experiment shows that this algorithm is capable of good meshing quality without the need for remeshing step, and meshes adapt to the local curvature of the surfaces, and thus the effectiveness of this algorithm is demonstrated.关键词
隐式曲面/三角网格化/曲率/扩张多边形/冲突检测Key words
implicit surface/ triangulation mesh/ curvature/ expanded polygon/ collision detection分类
信息技术与安全科学引用本文复制引用
范媛媛,杨斌..曲率约束的隐式曲面三角网格化[J].计算机工程与应用,2013,49(3):182-185,189,5.基金项目
安徽省教育厅自然科学基金(No.KJ2011Z284). （No.KJ2011Z284）
