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

实现约束Delaunay三角剖分的健壮算法
引用本文:周晓云,刘慎权.实现约束Delaunay三角剖分的健壮算法[J].计算机学报,1996,19(8):615-624.
作者姓名:周晓云  刘慎权
作者单位:中国科学院计算技术研究CAD开放实验室
摘    要:相对于标准的Delaunay三角剖分,本文给出了复杂区域三角剖分所应满足的两个约束条件及相应的基于轨迹生成和边界裁剪的剖分算法,并证明了该算法符合约束圆准则,文中详细分析了退化及数值误差对剖分结果的影响,着重在提高算法健壮性方面,对该算法做了进一步完善,使它能够完全满足散乱据场网格剖分的分析。

关 键 词:三角剖分  计算几何  算法  Delaunay

A ROBUST ALGORITHM FOR CONSTRAINED DELAUNAY TRIANGULATION
Zhou Xiaoyun, and Liu Shenquan.A ROBUST ALGORITHM FOR CONSTRAINED DELAUNAY TRIANGULATION[J].Chinese Journal of Computers,1996,19(8):615-624.
Authors:Zhou Xiaoyun  and Liu Shenquan
Abstract:This paper,for standard Delaunay triangulation, gives two constrainedconditions and algorithm based on path generation and boundary trimming for trian gulation of complicated region. A simple proof is given that the algorithm conformsto the constrained circle criterion. The influences of degeneracies and numerical er rors to triangulation result are also analyzed in detail. The algorithm is greatly in proved in robustness,so it can be used for triangulation of scattered data field.
Keywords:Scattered data  triangulation  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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