简单多边形三角剖分算法  

A Simple Polygon Triangulation Algorithm

作　　者：武若[1] 张新东[1] 

机构地区：[1]石家庄经济学院,河北省050031

出　　处：《微计算机信息》2010年第30期226-227,共2页Control & Automation

摘　　要：简单多边形的三角剖分,在计算机图形学及地学问题三维重建领域有着广泛的应用。本文根据简单多边形的定义和三角剖分原则,提出了一种简单多边形三角剖分的算法,该算法通过判断某顶点和基边之间的位置来实现对简单多边形的三角剖分,算法实现简单,容易理解,适用于任意简单多边形的三角剖分。The triangulation of simple polygon has been widely applied to computer graphics and three-dimensional reconstruction of geological problems.This paper presents an algorithm of a simple polygon triangulation based on the definition of the simple polygon and the principle of the triangulation.The algorithm achieves the triangulation of a polygon through determining the position between a vertex and basic edge.The algorithm is simple,easy to understand and for any simple polygon triangulation.

关 键 词：简单多边形 三角剖分 计算机图形学 基边 

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