首页 | 本学科首页   官方微博 | 高级检索  
     

基于Delaunay三角网的任意多边形三角剖分算法研究
引用本文:刘刚,袁纪武,李磊,王春.基于Delaunay三角网的任意多边形三角剖分算法研究[J].计算机与数字工程,2012,40(6):121-123.
作者姓名:刘刚  袁纪武  李磊  王春
作者单位:中国石油化工股份有限公司青岛安全工程研究院 青岛266071
摘    要:文章通过分析现有多边形三角剖分算法,给出一种基于Delaunay三角网的任意复杂多边形三角剖分的改进算法。算法首先忽略多边形顶点与边线间的逻辑关系,将其看做散乱顶点的集合,然后采用Delaunay三角化方法对点集进行合理剖分,再依据多边形顶点及边线间的逻辑关系,逐一将那些不合理的三角网剔除,最终重新组合出符合要求的三角网格。

关 键 词:Delaunay  任意多边形  三角剖分  三角网格

Study on Algorithm for the Triangulation of Arbitrary Polygons Based on Delaunay Trigonometry Network
LIU Gang , YUAN Jiwu , LI Lei , WANG Chun.Study on Algorithm for the Triangulation of Arbitrary Polygons Based on Delaunay Trigonometry Network[J].Computer and Digital Engineering,2012,40(6):121-123.
Authors:LIU Gang  YUAN Jiwu  LI Lei  WANG Chun
Affiliation:(SINOPEC Research Institute of Safety Engineering,Qingdao 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.
Keywords:Delaunay  arbitrary polygons  triangulation  triangular mesh
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号