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

二维任意域约束Delaunay三角化的实现
引用本文:徐永安,杨钦.二维任意域约束Delaunay三角化的实现[J].工程图学学报,1999(1):51-55.
作者姓名:徐永安  杨钦
作者单位:[1]浙江大学机械系 [2]北京航空航天大学计算机系
摘    要:本文设计了一种逐点加入一局部换边法,提出并证明了二维约束边在约束Delaunay三角化中存在的条件,并据此用中点加点法实现了二维任意域的Delaunay三角剖分,生成的网格均符合Delaunay优化准则,网格的优化在网格生成过程中完成,算法复杂度与点数呈近似线性关系,给出了算法在平面域剖分和包含复杂断层的石油地质勘探散乱数据点集剖分的应用实例。

关 键 词:三角化  Delaunay准则  Delaunay三角化  约束点

CONSTRAINED DELAUNAY TRIANGULATION OF 2D ARBITRARY DOMAIN
Xu Yongan, Tan Jianrong.CONSTRAINED DELAUNAY TRIANGULATION OF 2D ARBITRARY DOMAIN[J].Journal of Engineering Graphics,1999(1):51-55.
Authors:Xu Yongan  Tan Jianrong
Affiliation:Xu Yongan; Tan Jianrong(Department of Mechanism Zhejiang University)Yang Qin;Chen Qiming(Department of Computer Science Beijing University of Aeronautics and Astronautics)
Abstract:A new triangulation algorithm is suggested. The prerequisite of 2D constrained edge existing in constrained Delaunay triangulation is presented and proved. Constrained Delaunay triangulation of 2D arbitrary domain is reallied by means of adding midpoints. Mesh optimization isdone with the creation of mesh. The resulted mesh meets the Delaunay criteria. The algorithmcomplexity is about linear to the number of points. Applications in oil and geology explorationshow that the algorithm can deal with scattered data with complicated faults.
Keywords:triangulation  Delaunay criteria  constrained Delaunay triangulation
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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