Algorithm of 3D Constrained Delaunay Tetrahedralization
This paper mainly presents an algorithm of initial mesh generation in 3D constrained Delaunay tetrahedralization. This paper based on the incremental algorithm and the local transformational algorithm which proposed randomized incremental flip algorithm, and discussed the details about the basic steps of the algorithm. Compared with traditional initial mesh generation algorithm, it does not require the order of the vertices, and omits the considerations about the order of vertices in procedural, and increases efficiency. The algorithm is implemented easily and proved well by some examples.
tetrahedralization constrained Delaunay flip
Mingjun Liu Yanhua Chen Xiuyang Zhao
School of Electrical Engineering and automation Harbin Institute of Technology Harbin, China School of Information Science and Engineering University of Jinan Jinan, China
国际会议
2010 International Conference on Circuit and Signal Processing(2010年电路与信号处理国际会议 ICCSP 2010)
上海
英文
249-252
2010-12-25（万方平台首次上网日期，不代表论文的发表时间）