检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海交通大学港口与海岸工程系 [2]天津大学建筑工程学院,天津300072
出 处:《上海交通大学学报》2002年第11期1697-1702,共6页Journal of Shanghai Jiaotong University
基 金:国家自然科学基金 (4 980 60 0 5 );教育部"跨世纪优秀人才培养计划"基金 (教技函 [1999] 2号 )资助项目
摘 要:为了进行长江口水动力过程等的有限元数值模拟 ,研究了任意平面区域的 Delaunay三角剖分和基于背景网格等值线点集的新的自动生成方法 :在局部三角形内得到等值线、进行自动加点 ;改进了任意平面区域的 Delaunay三角剖分法 ,与行波法结合 ,从区域边界向域内逐步三角化 .前者简化了自动加点算法 ,保证新生成点均位于域内、疏密连续变化和最终网格具有良好形态 ;后者则统一解决了多连通、4点共圆和非凸域的自动三角剖分问题 ,逐步减少人为给定边界的影响 ,从而减少了算法的运行时间 .据此开发的软件包可动态监控点、网格的生成过程 ,并经大量的测试、验证 ,应用于长江口北槽水域的自动加点和三角剖分 。In order to numerically model the hydrodynamics process in the Changjiang River estuary, this paper studied the Delaunay triangulation of an arbitrary planar domain and the new automatically generating method of the interior nodal points, based on the contour lines of the given planar domain. Firstly, to obtain the contour lines and automatically added points within a local triangle. Secondly, to improve Delaunay triangulation method coupled with wave front method and gradually triangulate the arbitrary planar domain from the boundaries to the interiors. Correspondingly, ① to simplify the algorithms and ensure that the newly generated points are exactly within the domain with smooth points densities and the final mesh has a good shapes, ② to uniquely solve the automatic triangulation problem within the multi connected, four points sharing one circle or non convex domains, thus to reduce the possible influences of the artificial boundaries and shorten the algorithm time. Using the above methods, one software, by which the generating process of the points and meshes can be dynamically monitored, was developed and tested by several examples. Its application to the north passage of the Changjiang River estuary is successful.
关 键 词:任意平面区域 点集生成 DELAUNAY三角剖分 长江口
分 类 号:TV131.4[水利工程—水力学及河流动力学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117