带内边界约束散乱数据的Delaunay三角剖分算法研究  

Delaunay Triangulation of a 2D Scattered Data Set with Inner Boundary Constraints

作　　者：简宪华[1] 崔汉国[1] 曹茂春[1] 高诚 朴成日[1] 

机构地区：[1]海军工程大学,武汉430033

出　　处：《计算机工程》2001年第5期105-106,共2页Computer Engineering

摘　　要：带内边界约束条件点集的三角剖分是有限元分析、计算机图形学及真实感图形等许多领域常遇到的一个基本问题。在已有算Delauney法的基础上通过插入中点恢复约束边界,较好地实现了带内边界约束散乱数据的三角剖分。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. ;;

关 键 词：内边界约束 散乱数据 DELAUNAY三角剖分算法 计算机图形学 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]