A New Two-dimensional Triangulation Algorithm

摘要：

Triangulation algorithm is a general method in curve surface generation and three-dimensional modeling, and its efficiency is critical factor in the applications. In this paper, a new two-dimensional triangulation algorithm is presented. Firstly a series of convex hulls are obtained by R.L Graham scanning from the original area, and meanwhile the original area is divided into several sub-areas And then via triangulating the sub-area between every two neighbor convex hulls, the whole original area is triangulated. Experimental results show that compared with former algorithms, the new algorithm has better performance in time saving and complexity.

关键词： R.L. Graham scanning Convex hull Self-adaptive Delaunay triangulation

作者: Huabin Yang Gang Wang Dongmei Zhang

作者单位: Telecommunication Engineering Institute, Air Force Engineering University, Shanxi, 710077, China;Uni Science Institute, Air Force Engineering University, Shanxi, 710077, China

会议类型: 国际会议

会议名称: 第七届国际测试技术研讨会

会议地点: 北京

会议语种:英文

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