基于二次划分的大规模三角网曲面求交分割法
|
摘要
在地质建模过程中,层位面与层位面之间,断层面与层位面之间经常需要求交运算。由于地震数据解释得到的层位面和断层面往往数据量非常庞大,因此研究时间复杂度、空间复杂度都很低的求交算法,具有很强的理论意义和实用价值。这里提出一种新算法,先构造两曲面的最小包围盒,求出相交部份,再对相交部份空间构造出平均单元格,将各三角形分配到平均单元格后进行求交,最后根据交线进行曲面分割。数值实验表明,该算法能正确地、高效地求交,并根据交线有效完成曲面分割。
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.
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.
引文
[1]张华,叶显高,李德群.基于网格划分的曲面求交算法[J].计算机应用,1994(6):54.
[2]蒋钱平,唐杰,袁春风.基于平均单元格的三角网格曲面快速求交算法[J].计算机工程,2008,34(21):172.
[3]S GOTTSCHALK,D MANOCHA.OBBTree:AHierarchical Structure for Rapid Interference Detec-tion[C]//Proceedings of SIGGRAPH′96.New Orle-ans,Louisiana,USA:[s.n.],1996.
[4]刘健,孙殿柱,李廷瑞,等.散乱点云局部点集最小包围盒快速求解算法[J].农业装备与车辆工程,2010(6):27.
[5]初剑,魏志强,孟详宾,等.基于Delaunay三角剖分的曲面求交技术[J].系统仿真学报,2009(21):155.
[2]蒋钱平,唐杰,袁春风.基于平均单元格的三角网格曲面快速求交算法[J].计算机工程,2008,34(21):172.
[3]S GOTTSCHALK,D MANOCHA.OBBTree:AHierarchical Structure for Rapid Interference Detec-tion[C]//Proceedings of SIGGRAPH′96.New Orle-ans,Louisiana,USA:[s.n.],1996.
[4]刘健,孙殿柱,李廷瑞,等.散乱点云局部点集最小包围盒快速求解算法[J].农业装备与车辆工程,2010(6):27.
[5]初剑,魏志强,孟详宾,等.基于Delaunay三角剖分的曲面求交技术[J].系统仿真学报,2009(21):155.
版权所有：© 2023 中国地质图书馆 中国地质调查局地学文献中心