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

任意平面域上离散点集的三角化方法
引用本文:杨 钦,徐永安,陈其明,谭建荣.任意平面域上离散点集的三角化方法[J].软件学报,1998,9(4):241-245.
作者姓名:杨 钦  徐永安  陈其明  谭建荣
作者单位:1. 北京航空航天大学计算机系,北京,100083
2. 浙江大学机械系,杭州,310027
摘    要:本文提出了一种快速、有效的三角化算法,实现了任意平面域上散乱数据的三角化,生成的网络符合Delaunay准则,网格的优化是在网格生成过程中完成的,算法复杂度与点数呈近似线性关系.该算法运用于石油地质勘探领域,成功地解决了包含复杂断层的大规模数据点的三角化问题.

关 键 词:三角化  网格  Delaunay准则  任意平面域  离散点集.
收稿时间:1996/10/17 0:00:00
修稿时间:1997/10/17 0:00:00

Triangulation Algorithm of Scattered Data on Arbitrary Planar Domain
YANG Qin,XU Yong-an,CHEN Qi-ming and TAN Jian-rong.Triangulation Algorithm of Scattered Data on Arbitrary Planar Domain[J].Journal of Software,1998,9(4):241-245.
Authors:YANG Qin  XU Yong-an  CHEN Qi-ming and TAN Jian-rong
Affiliation:YANG Qin 1 XU Yong an 2 CHEN Qi ming 1 TAN Jian rong 2 1(Department of Computer Science Beijing University of Aeronautics and Astronautics Beijing 100083) 2(Department of Mechanism Zhejiang University Hangzhou 310027)
Abstract:A fast and efficient triangulation algorithm is presented in this paper. The scattered data on any 2D shape is triangulated by this algorithm. Triangular mesh optimization is done at the same time with mesh creating. The resulted mesh is fit to Delaunay criteria. The algorithm complexity is about linear to the number of points. Application in oil and geology exploration, the algorithm can deal with large scale scattered data including complicated faults.
Keywords:Triangulation  mesh  Delaunay criteria  arbitrary planar domain  scattered data  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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