节点文献
带断层地震数据的Delaunay三角剖分算法
Algorithm of Delaunay triangulation for seismic data with fault
【摘要】 数据网格化是三维地质建模的常用方法。断层是普遍的地质现象,带断层的海量数据三角剖分在建模中较为复杂。提出了一种简单的可以解决带断层地震数据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 com-plex.A succinct effective algorithm to solve the problem is proposed in the paper.At first,the algorithm triangu-lates 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.
- 【文献出处】 煤田地质与勘探 ,Coal Geology & Exploration , 编辑部邮箱 ,2008年06期
- 【分类号】TP391.41
- 【被引频次】4
- 【下载频次】106