计算机与数字工程2012，Vol.40Issue(6)：121-123,3.
基于Delaunay三角网的任意多边形三角剖分算法研究
Study on Algorithm for the Triangulation of Arbitrary Polygons Based on Delaunay Trigonometry Network
刘刚 1袁纪武 1李磊 1王春1
作者信息
- 1. 中国石油化工股份有限公司青岛安全工程研究院 青岛266071
- 折叠
摘要
Abstract
The paper introduces an improved algorithm for the triangulation of arbitrary polygons based on the Delaunay by analyzing the existing algorithms for the triangulation of the polygons. This algorithm firstly regardes the polygon vertices as scattered points by ignoring the logical relationship between polygon vertices and sides. And then, it created reasonable trigonometry network by Delaunay triangulation for the scattered points. At last,by eliminating the unreasonable triangular mesh based on the logical relationship between polygon vertices and sides, the reasonable triangulation of arbitrary polygons is created.关键词
Delaunay/任意多边形/三角剖分/三角网格Key words
Delaunay/ arbitrary polygons/ triangulation/ triangular mesh分类
信息技术与安全科学引用本文复制引用
刘刚,袁纪武,李磊,王春..基于Delaunay三角网的任意多边形三角剖分算法研究[J].计算机与数字工程,2012,40(6):121-123,3.
