【摘要】 海量地震数据网格化是三维地质建模的常用方法.断层是普遍的地质现象,带断层的海量数据三角剖分在建模中较为复杂.提出一种简单的可以解决带断层Delaunay三角剖分有效算法.该算法首先对数据边界进行初始Delaunay三角剖分,然后将其变尺度加密,生成较均匀三角网,最后将断层边强行嵌入三角网,实现了三角网格化.更多还原

【Abstract】 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.更多还原