摘要
在石油领域,经过多年的研究和发展,一些网格相关的基本算法如Delaunay三角网生成算法等已逐渐趋于成熟。然而伴随技术的发展,行业对相关算法和软件的要求也不断提高,现有方法已经不能满足实际需要。文中分析了目前常规三角网生成算法的特点和缺点,提出了一种将逐点和分治相结合的快速生成Delaunay三角网格的方法,使得布点数目对构网效率不会产生较大影响。通过大量测试验证了该算法在正确性、稳定性和效率上较传统算法具有较大优势。
After years of research and development in the petroleum field,some grid-related basic algorithms such as Delaunay triangulation algorithm have gradually matured.However,with the development of technology,the requirements of relevant algorithms and software in the industry are constantly improving,so the existing methods can no longer meet the actual needs.This paper studied and analyzed the characteristics and shortcomings of the conventional triangulation algorithm.It proposed a method by using the idea of point-by-point and divide-and-conquer to quickly generate Delaunay triangle mesh,so that the number of layout points will not have a great impact on the efficiency of network construction.A large number of tests verify that the algorithm has greater advantage compared with traditional algorithms in terms of correctness,stability and efficiency.
作者
青文星
陈伟
QING Wen-xing;CHEN Wei(School of Computer Science,Southwest Petroleum University,Chengdu 610500,China)
出处
《计算机科学》
CSCD
北大核心
2019年第B06期226-229,共4页
Computer Science
关键词
DELAUNAY三角网
逐点法
分治法
Delaunay triangulation
Point by point method
Divide-and-conquer method
作者简介
青文星(1993-),男,硕士生,主要研究方向为GIS与计算几何;陈伟(1965-),男,博士,主要研究方向为科学计算可视化与石油工程计算,E-mail:ncchenwei@163.com通信作者:。
