简单多边形快速三角剖分算法  

Fast algorithm for triangulation of simple polygon

作　　者：王欣[1] 程耀东[2] 

机构地区：[1]兰州交通大学铁道技术学院,兰州730000 [2]兰州交通大学数理软件工程学院,兰州730070

出　　处：《测绘科学》2010年第S1期79-80,共2页Science of Surveying and Mapping

摘　　要：多边形的三角剖分,在计算机图形学及地学三维建模领域有着广泛的应用。本文针对已有的三角剖分算法的不足,提出了基于最小内角判定的简单多边形的三角剖分算法,剖分结果完全符合要求而且网型比较好。Being basic methods of calculating geometry,the triangulation of simple polygon has been widely applied in computer graphics and 3D geographic modeling.This paper presented a fast algorithm for triangulation of simple polygon based on minimum interior angles.The result of triangulation conformed to the requirement completely and the style of net was somewhat good.

关 键 词：三角剖分 简单多边形 最小内角 

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