基于bowyer-watson法的delaunay三角网格生成及其软件实现-科学计算及其应用软件专业论文.docxVIP

基于Bowyer．Watson法的Delannay三角网格生成及其软件实现李景焕 基于Bowyer．Watson法的Delannay三角网格生成及其软件实现 李景焕 南开大学数学科学学院 摘 要 本文讨论了基于Bow-er-Watson法的Delaunay三角网格的生成方法及其软件 实现过程。生成Delaunay三角网格的方法中，目前应用最广泛的大都基于Bowyer· Watson法，它的基本思路是：先由给定的点集生成一初始网格，再根据Delaunay剖 分原理逐次加点并重新连接生成新网格，直至网格尺寸满足要求。Bowyer一Ⅵratson法 生成初始网格时，需要删除计算区域外的多余三角形，这对凹域或多连通区域来说是 一件相当繁琐的工作。本文针对这种情况，提出一种新方法，即用“有向线段推进法” 生成初始网格，这种方法生成的初始网格的三角形都在计算区域内，避免了删除多余 三角形。在网格逐次加点的过程中，本文采用分级的方法来选择加点三角形，改善了 边界附近的网格效果。另外，本文用尺寸函数来控制内部网格点的分布；对尺寸函数 的生成方法进行了总结与拓展，提出用“背景网格法”生成尺寸函数。 关键词t Bowyer‘Watson法，Delaunay三角剖分，初始网格，凹域或多连通域 尺寸函数，背景网格 Delaunay Delaunay Tiangulations Based on Bowyer一＼Vatson Algorithm and Its Software Application Li Jinghuan College of Mathematics Science，Nankai University Abstract In this thesis，we discuss the Delaunay triangulations based Bowyer一％Vatson algorithm and its software design method．Among Delaunay triangulations，at present， most of methods based Bowyer—Watson algorithm．The outline of this algorithm is follows：first，we generate initial mesh of given points，Then，according to Delaunay principle．we insert point after another and reconnect the mesh till the mesh size satisfies demand．In the initialⅡⅫh generation procedure．the necessary work is to eliminate the redundant trimlgles outside the computational domain．It is very troublesome assignment for and multiply connected domains．To solve this problem，we present new approach，namely,we use“vector segment advancing method”to generate initial mesh．By this way,the triangles of initial mesh inside the computational domain，which avoids eliminating the redundant triangles．In this thesis，we insert point into triangle，which is selected according to different level．By this way,triangles the boundary improved．Moreover，we size-function to control the inner point distribution，we summarize and expand the generation methods of size—function．give“background mesh mGhod”to generate dze-fnnetmn． Key、Vords：Bowyer—Watson algorithm，Ddaunay triangulation，initial mesh， and multiply connected domains，s