基于双向拉链的网格模型过渡算法  

Mesh Blending Approach Based on Bi-directional Zipper Method

作　　者：程筱胜[1] 袁天然[1] 戴宁[1] 

机构地区：[1]南京航空航天大学,南京210016

出　　处：《中国机械工程》2009年第6期693-699,共7页China Mechanical Engineering

基　　金：国家863高技术研究发展计划资助项目(2005AA420240);江苏省科技攻关项目(BE2005014);南京市医学科技发展计划资助项目(ZKX0420);南京市科技发展计划资助项目(200504022)

摘　　要：基于拉链的拉合机理及径向基函数(RBF)网络能够平滑地插值不规则分布的高维数据的性质,提出了一种基于双向拉链的网格模型间的过渡算法。首先,对待过渡的网格模型边界根据拉链拉合的思想进行网格化生成初始过渡网格,并对初始过渡网格按待过渡网格模型的边界条件进行细分、优化调整,生成与原始模型网格密度(三角片大小)相似的过渡网格;然后,对待过渡的网格模型边界顶点及对应单位法矢约束插值生成基于RBF的隐式曲面;最后,运用牛顿迭代逼近,把细分、优化后的过渡网格顶点投影到隐式曲面上,生成所求的最终网格。实验分析表明,运用所提算法对网格模型进行过渡融合,可以得到与原始模型网格密度相近且边界光滑连续的过渡网格,具有较好的工程应用价值。A novel mesh blending approach was proposed, which can blend different triangle meshes according to the boundary conditions flexibly and intuitively. It was mainly composed of the following steps： （1） triangulated boundaries of the triangle meshes to be blended as the way of bidirectional zipper working, and got a coarse blending mesh patch in which the triangle was simply the connections between vertices of boundaries; （2）refined the coarse blending mesh patch according to the meshes＇ boundaries density, and also relaxed interior edges when refining to maintain a Delaunay-like triangulation, after refining and relaxing, we got an optimized blending mesh patch; （3） interpolated the boundaries constraints and their corresponding normal constraints by a smooth implicit surface based on radial basis functions. Using Newton＇s iteration method, the optimized blending mesh patch＇s vertices were mapped onto the corresponding points in the implicit surface, and the final blending mesh patches were obtained, which smoothly and continuously fitting across the boundaries. The effectiveness of the proposed method was tested and proved in many experiments of different kinds of boundaries conditions.

关 键 词：网格过渡 牛顿迭代 隐式曲面 拉链 

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