优化的三角网格曲面求交算法  

Optimization algorithm for triangular mesh surface intersection

作　　者：李宁[1] 田震[1] 张立华[1] 彭认灿[1] 董箭[1] 

机构地区：[1]海军大连舰艇学院海洋测绘系,辽宁大连116018

出　　处：《辽宁工程技术大学学报（自然科学版）》2013年第9期1269-1273,共5页Journal of Liaoning Technical University (Natural Science)

基　　金：国家自然科学基金资助项目(41171349);国家"863"计划基金资助项目(2012AA12A406)

摘　　要：针对当前三角网格曲面求交算法存在计算效率不高、交线追踪困难的问题.提出了一种优化的三角网格曲面求交算法,通过建立层次包围盒、改进三角形对求交方法提高曲面求交效率,并利用拓扑关系优化交线生成的追踪过程.研究结果表明:在保证精度的前提下,该算法能够提高三角网格曲面的求交效率.Aiming at the drawbacks of the current algorithm for triangular mesh surface intersection being low efficiency and difficult to trace intersection line,an optimization algorithm is presented.The intersection efficiency is speeded up by constructing hierarchical bounding box and improving triangle pairs intersection method,and the intersection line generating process is optimized based on topology.Experimental results demonstrate that the presented algorithm can improve the efficiency of triangular mesh surface intersection,under the premise of ensuring precision.

关 键 词：曲面求交 三角网格 优化算法 层次包围盒 三角形求交 拓扑关系 交线追踪 效率 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]