Boundary Recovery Algorithm of 3D Constrained Delaunay Triangulation

摘要：

The paper introduces the process of an algorithm of 3D constrained Delaunay tetrahedralization(CDT), and propose an efficient boundary recovery algorithm. On the basis of the generation of the initial tetrahedralization, it only requires a few additional points to be inserted to achieve the edge recovery, and implement face recovery after the local degeneracy is removed. The algorithms are proved to be efficient, robust and easy to be implemented in practical applications.

关键词： tetrahedralization constrained Delaunay triangulation boundary recovery

作者: Chen Yan-hua Liu Ming-jun Zhao Xiu-yang

作者单位: School of Information Science and Technology University of Jinan Jinan, China School of Electrical Engineering and automation Harbin Instit ute of Technology Harbin Heilongjiang,

会议类型: 国际会议

会议名称: 2010 Third Pacific-Asia Conference on Web Mining and Web-based Application(2010年第三届web挖掘和基于web应用亚太会议 WMWA 2010)

会议地点: 桂林

会议语种:英文

页码: 292-295

在线出版日期: 2010-11-17（万方平台首次上网日期，不代表论文的发表时间）