首页 | 本学科首页   官方微博 | 高级检索  
     

基于图的任意域内点集的Delaunay三角剖分算法
引用本文:潘志庚,马小虎,董军,石教英.基于图的任意域内点集的Delaunay三角剖分算法[J].软件学报,1996,7(11):656-661.
作者姓名:潘志庚  马小虎  董军  石教英
作者单位:浙江大学CAD&CG国家重点实验室,杭州,310027;浙江大学CAD&CG国家重点实验室,杭州,310027;浙江大学CAD&CG国家重点实验室,杭州,310027;浙江大学CAD&CG国家重点实验室,杭州,310027
基金项目:本文研究得到国家自然科学基金资助.
摘    要:本文提出了一种基于图的二维任意域内点集的Delaunay三角剖分算法.该算法首先求出任意域内点集的约束最小生成树,然后逐次加入一边构造三角形网格,最后通过局部优化变换,得到二维任意域内点集的Delaunay三角剖分.本文还给出了该算法在有限元网格自动生成过程中的应用.

关 键 词:约束最小生成树    任意域    Delaunay三角剖分    有限元网格  
修稿时间:1996/6/20 0:00:00

A GRAPH BASED ALGORITHM FOR GENERATING THE DELAUNAY TRIANGULATION OF A POINT SET WITHIN AN ARBITRARY 2D DOMAIN
Pan Zhigeng,Ma Xiaohu,Dong Jun and Shi Jiaoying.A GRAPH BASED ALGORITHM FOR GENERATING THE DELAUNAY TRIANGULATION OF A POINT SET WITHIN AN ARBITRARY 2D DOMAIN[J].Journal of Software,1996,7(11):656-661.
Authors:Pan Zhigeng  Ma Xiaohu  Dong Jun and Shi Jiaoying
Affiliation:State Key Laboratory of CAD&CG Zhejiang University Hangzhou 310027
Abstract:A graph based algorithm for generating the delaunay triangulation of a point set within an arbitrary 2D domain (denoted as DTAD for short) is presented in this paper. The basic idea is to calculate the CMST(constrained minimum spanning tree) of the given points within an arbitrary 2D domain. The CMST is then augmented to triangle mesh. Finally the DTAD is obtained by local optimal transformation. The actual application of the algorithm in the automatic finite element mesh generation is also shown in the paper.
Keywords:Constrained minimum spanning tree  arbitrary domain  delaunay triangulation  finite element mesh  
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号