摘要
本文重点研究任意多边形的Delaunay三角剖分,研究发现现有常用任意多边形Delaunay三角剖分存在执行效率低、候选节点可能出现"位置违约"错误等缺陷,根据候选节点与当前边夹角的大小关系,本文提出一种基于有向边的任意多边形Delaunay三角剖分改进算法,该算法具有执行效率高,避免了现有常用算法中可能出现"位置违约"的错误,完善了原算法的健壮性。
This paper focuses on the Delaunay triangulation for arbitrary polygon. According to the study, there are shortcomings of common Delaunay triangulation algorithm on the arbitrary polygon with low efficiency and the possible wrong result of the ＂irregular position＂ candidate vertex. According to the size of the angles made by candidate vertexes and current edge and modifying the crite- rion by computing the angle of candidate vertex with respect to the current edge, this paper proposes an improved algorithm for arbi- trary polygon Delaunay triangulation based on directed edge, which has a high executing efficiency, avoid the possible wrong result of the ＂irregular position＂ and improve the robustness of the original algorithm.
出处
《微计算机信息》
2009年第21期202-204,共3页
Control & Automation
基金
申请人:何凯涛
肖克炎
李楠等
项目名称:矿产资源评价数字矿床模型及可视化技术研究
基金颁发部门:中华人民共和国科学技术部(2006AA062114)
