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

带内边界约束散乱数据的Delaunay三角剖分算法研究
引用本文:简宪华,崔汉国,曹茂春,高诚,朴成日.带内边界约束散乱数据的Delaunay三角剖分算法研究[J].计算机工程,2001,27(5):105-106.
作者姓名:简宪华  崔汉国  曹茂春  高诚  朴成日
作者单位:海军工程大学,
摘    要:带内边界约事条件点集的Delauney三角剖分是有限元分析、计算机图形学及真实感图形等许多领域常遇到的一个基本问题,在已有算法的基础上通过插入中点恢复约束边界,较好地实现了带内边界约束散乱数据的Delaunay三解剖分。

关 键 词:内边界约束  散乱数据  Delaunay三角剖分算法  计算机图形学
文章编号:1000-3428(2001)05-0105-02
修稿时间:2000年10月13

Delaunay Triangulation of a 2D Scattered Data Set with Inner Boundary Constraints
JIAN XianhuaCUI HanguoCAO MaochunGAO ChengPIAO Chengri.Delaunay Triangulation of a 2D Scattered Data Set with Inner Boundary Constraints[J].Computer Engineering,2001,27(5):105-106.
Authors:JIAN XianhuaCUI HanguoCAO MaochunGAO ChengPIAO Chengri
Abstract:The delaunay triangulation of a 2D scattered data set with inner boundary constraints is one of the basic questions in finite element analysis,computer graphics and realistic graphics etc.In this paper,an algorithm for generating delaunay triangulation of 2D scattered data set with inner boundary constraints is presented by inserting the midpoint of the bounder which isn't existed. ;;
Keywords:Inner boundary constraintsScattered data setDelaunay triangulation
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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