一种三角形网格自动生成技术  

An Automatic Triangulation Technique

作　　者：谷汉斌[1] 李炎保[1] 李焱[2] 戈龙仔[2] 

机构地区：[1]天津大学建筑工程学院,天津300072 [2]交通部天津水运工程科学研究所,天津300456

出　　处：《水道港口》2005年第2期71-74,共4页Journal of Waterway and Harbor

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

摘　　要：在研究总结目前流行的三角形网格自动生成法的基础上,提出前沿生成与Delaunay三角化组合起来的三角形自动生成方法。该方法解决了Delaunay法中离散点域的构造问题,不会产生重合点,不用进行点集排序和坏点剔除,同时避免了前沿生成法中过多的校验。该法计算效率高,对复杂边界适应性好,可实现三角形尺度的渐变过渡。应用该方法成功进行了三峡电站日调节数学模型计算域的自动剖分。The popular automatic triangulation methods are thoroughly studied.Then,a automatic triangulation is proposed,which combines the advancing-front method with Delaunay truangulation.The data point aggregate which should be given in Delaunay method is automatically formed,and in which the order of the point meed not to be arranged,the point positions do not overlap,no points need to be removed.In the meantime,many verifications in the advancing-front method are avoided.The method is efficient in calculation and suitable for arbitrary boundary.It make the size of triangle vary gradually and is successfully applied in the project of numerical simulation in Sanxia Power Station adjusting daily discharge of water.

关 键 词：三角形网格 Dehaunay三角化 前沿生成法 空间尺度权函数 

分 类 号：O241[理学—计算数学]