Algorithm for Surface Intersection and Cutting of Massive Triangular Meshes on Double Partition
详细信息
- 责任者：Luo Wenlong (College of Informatic ; South China Agricultural University ; Guangzhou 510642 ; China) ; Xiong Gaojun
- 刊名：Computing Techniques for Geophysical and Geochemical Exploration
- 出版年：2013
- 卷期：35(3)
- 关键词：地震勘探 ; seismic exploration ; 地质建模 ; geological modeling
- 页码：p.355-359
- 图表：illus., 5 refs.
- 分类号：1600
- issnNo：ISSN1001-1749
- isbnNo：CN51-1242/P
摘要
During geological modeling,it′s often needed for us to do intersecting between different horizons or between horizons and faults.The horizons and the faults by seismic data interpretation is often a very large amount of data,research intersection algorithm whose both time complexity and space complexity are very low has a strong theoretical significance and practical value.A new method is presented here.Firstly,the intersecting area of two surfaces is acquired through constructing the minimal bounding boxes;secondly,the intersecting area is divided into uniform grid;thirdly,the intersecting line calculated out after every triangle being allocated to the uniform grid;fourthly,cut the surfaces according by the intersecting line.Shown by numerical test,intersecting line can be acquired and surfaces can be separated accurately and efficiently.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |