基于投影法的四面体网格切割算法  

Tetrahedron Mesh-Cut Algorithm Based on Projective Method

作　　者：王征[1] 章品正[1] 周正东[2] 梁晓云[1] 罗立民[1] 

机构地区：[1]东南大学影像科学与技术实验室,南京210096 [2]南京航空航天大学医学物理系,南京210016

出　　处：《数据采集与处理》2006年第4期423-427,共5页Journal of Data Acquisition and Processing

摘　　要：四面体网格切割算法是有限元仿真中的重要组成部分,切割的结果决定了刚度矩阵的更新速度和精度。本文在研究Cotin算法和B ie lser算法的基础上,采用了预投影的方法,将部分顶点投影到切割平面上,使原先的四面体分割转化为相邻四面体分离,以达到简化分割的目的。与Cotin算法和B ie lser算法相比,由该算法得到的网格切割边界更加合理,剖分比更低,提高了刚度矩阵更新的速度和精度。The tetrahedron mesh-cut algorithm is an important part of finite element method （FEM）. The mesh-cut result determines the speed and the precision of stiff matrix regeneration. Based on the Cotin and the Bielser algorithms, the algorithm proposed in this paper projects the original mesh before mesh-cutting. Parts of the vertexes are projected on the segmented face. After being projected, the mesh segmenting is changed as mesh separating, so that the mesh-cut algorithm becomes easier. Compared with Cotin and Bielser algorithms, the algorithm makes the mesh-cut results more reasonable. Meanwhile, the increasing of the tetrahedron number is lower, thus improving the speed and the precision of stiff matrix regeneration.

关 键 词：三维有限元网格 切割 三角形网格 网格剖分 

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