作　　者： ; ; ;

机构地区： 华南农业大学信息学院

出　　处： 《物探化探计算技术》 2013年第3期355-359,252,共5页

摘　　要： 在地质建模过程中,层位面与层位面之间,断层面与层位面之间经常需要求交运算。由于地震数据解释得到的层位面和断层面往往数据量非常庞大,因此研究时间复杂度、空间复杂度都很低的求交算法,具有很强的理论意义和实用价值。这里提出一种新算法,先构造两曲面的最小包围盒,求出相交部份,再对相交部份空间构造出平均单元格,将各三角形分配到平均单元格后进行求交,最后根据交线进行曲面分割。数值实验表明,该算法能正确地、高效地求交,并根据交线有效完成曲面分割。 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.

关 键 词： 曲面求交 曲面分割 地质模型 三角网格

领　　域： [天文地球] [天文地球]