摘要
相对于标准的Ｄｅｌａｕｎａｙ三角剖分，本文给出了复杂区域三角剖分所应满足的两个约束条件及相应的基于轨迹生成和边界裁剪的剖分算法，并证明了该算法符合约束回准则．文中详细分析了退化及数值计算误差对剖分结果的影响，着重在提高算法健壮性方面，对该算法做了进一步完善，使它能够完全满足散乱数据场网格剖分的要求．
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.
出处
《计算机学报》
EI
CSCD
北大核心
1996年第8期615-624,共10页
Chinese Journal of Computers
基金
国家自然科学基金
