一种含断层数据的变尺度加密三角剖分算法  

A VARIABLE SCALE ENCRYPTION TRIANGULATION ALGORITHM WITH FAULT DATA

作　　者：史晓楠[1] 王梦凡 王子童 Shi Xiaonan;Wang Mengfan;Wang Zitong(College of Computer Science and Technology,Xi’an University of Science and Technology,Xi’an 710054,Shaanxi,China)

机构地区：[1]西安科技大学计算机科学与技术学院

出　　处：《计算机应用与软件》2019年第12期239-244,共6页Computer Applications and Software

基　　金：国家自然科学基金项目(41472234)

摘　　要：由于传统无约束三角网在面对断层数据时无法处理,提出一种包含断层数据的变尺度加密三角剖分算法,主要用来解决如何将断层线段合理高效地嵌入无约束网格的问题。在传统逐点插入法的基础上提出“边界收缩”算法,得到高精细度凸包;采用变尺度方法整体网格进行合理加密,即设定剖分尺度,逐步细化断层数据;将细化后的断层数据嵌入原三角网信息中,利用生长法生成新的约束三角网。实验表明,对比其他三角剖分算法,经过变尺度加密后生成的三角网更加均匀,更容易实现断层线段的嵌入,提高了构网效率。Traditional unconstrained triangulation network cannot deal with fault data.Therefore,this paper proposed a variable scale encryption triangulation algorithm including fault data,which was mainly used to solve the problem of how to embedding fault segments into unconstrained mesh reasonably and efficiently.Based on the traditional point-by-point insertion method,a boundary contraction algorithm was proposed to obtain high-precision convex hulls.We used variable scale method to perform reasonable encryption on the whole grid,that is,to set the division scale and gradually refine the fault data.The refined fault data were embedded in the original triangulation information,and a new constrained triangulation network was generated by the growth method.Experiments show that compared with other triangulation algorithms,the triangulation generated by variable scale encryption is more uniform,and it is easier to embed fault segments and improve the efficiency of network construction.

关 键 词：边界收缩 断层数据 变尺度加密 三角剖分 

分 类 号：TP67[自动化与计算机技术—控制理论与控制工程]