三维重构中任意平面多边形轮廓的自适应Delaunay三角剖分  

Self-adaptive Delaunay Triangulation to Arbitrary Plane Polygons in 3-Dimensional Reconstruction

作　　者：纪小刚[1] 龚光容[1] 

机构地区：[1]南京理工大学机械工程学院,江苏南京210094

出　　处：《计算机应用研究》2006年第3期167-169,共3页Application Research of Computers

基　　金：国家"十五"预研项目(41318.1.1.7)

摘　　要：根据Delaunay三角剖分唯一、最优的特点,详细阐述了Delaunay三角剖分应用于特定的任意多边形轮廓的实现算法,介绍了相关的轮廓预处理技术,并对本算法提出了两点改进,给出了该三角剖分的应用实例。According to the characteristics of uniqueness and best of Delaunay triangulation, actualized algorithm to given arbitrary plane polygons used by Delaunay triangulation is expatiated in details. And the correlative pretreatment technology of arbitrary plane polygons is introduced. At last, this algorithm is improved in two aspects and an example of Delaunay triangulation is furnished.

关 键 词：DELAUNAY三角剖分 多边彤 三维重构 计算机图形学 

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