带断层地震数据的Delaunay三角剖分算法  

Algorithm of Delaunay triangulation for seismic data with fault

作　　者：刘少兵[1] 

机构地区：[1]西安科技大学计算机科学与技术学院,陕西西安710054

出　　处：《煤田地质与勘探》2008年第6期70-72,共3页Coal Geology & Exploration

摘　　要：数据网格化是三维地质建模的常用方法。断层是普遍的地质现象,带断层的海量数据三角剖分在建模中较为复杂。提出了一种简单的可以解决带断层地震数据Delaunay三角剖分的有效算法。该算法首先对数据边界进行初始Delaunay三角剖分,然后将其变尺度加密,生成较均匀三角网,最后将断层边界强行嵌入三角网,实现了三角网格化。Huge seismic data gridding is a common method to process three-dimensional geographical modeling. Fault is a universal geographic phenomenon. Delaunay triangulation megabytes data with faults is relatively complex. A succinct effective algorithm to solve the problem is proposed in the paper. At first, the algorithm triangulates the boundary of the data, then encrypts the grid and builds equality triangle network, at last embeds the faults into the grid to complete triangulation.

关 键 词：地震数据 断层 DELAUNAY三角剖分 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]