基于AIF的三角形网格切割方法

A Method Based on AIF for Cutting Triangle Mesh

在三角形网格的三维表面模型基础上,提出了一种基于AIF的三角形网格切割算法.切割过程中,首先通过AIF的网格拓扑结构检索算法,由离散的切割点来构造连续的切割路径,然后修改AIF,实现网格重建,获得新的三角形网格和拓扑结构,最后利用AIF与树型搜索算法实现对切割后独立三角形网格群的提取,获得切割分离的效果.试验结果表明,所提出的算法可较好地执行切割分离过程,并且得到较高的精确度和真实的切分绘制效果.

It is very popular to represent 3D surface model by triangle mesh in several fields. Based on triangle mesh model, this paper proposed an algorithm which applies adjacency and incidence framework （AIF） to implement efficient virtual cutting and splitting operation. There are three main steps composing the whole process, that is, definition of cutting path, reconstruction of triangle mesh and selection of isolated facets. By AIF algorithm, it is easy to get the continuous cutting path on any surface, to modify the triangle mesh and to get the relationship of facets＇ topology. With the searching technique, AIF also helps to separate certain isolated parts of mesh efficiently. Through this proposed method, it is quite easy to conduct efficient cutting and splitting and obtain more precise and better real visualized rendering view at last.