VC环境下Delaunay三角剖分算法的设计及实现  

Design and Realization of Delaunay Triangulation Algorithm in VC

作　　者：沈璐[1] 宋晓东[1] 邓宇[1] 

机构地区：[1]吉林建筑工程学院基础科学部,长春130118

出　　处：《吉林建筑工程学院学报》2012年第6期46-48,共3页Journal of Jilin Architectural and Civil Engineering

摘　　要：三角剖分算法在计算机图形学、模式识别等方面有重要的作用.本文以Visual C++为平台实现空间离散点的三角剖分.重建方法采用的是Bowyer-Watson算法来生成Delaunay三角网,并改进了其点定位搜索策略,还提出了一种新的数据结构,提高了三角剖分程序的执行效率,最后给出了此算法在双目立体视觉中的应用.Triangulation algorithm in computer graphics, pattern recognition, etc, were important role. Based on Visu-al C ＋ ＋ as a platform to realize space discrete point of triangulation. Reconstruction methods is Bowyer - Watson algorithm to generate Delaunay triangulation net, and improve its point positioning search strategy, the author also put forward a new data structure, improve the triangulations program execution efficiency. Finally, the paper puts for-ward the algorithm in the application of binocular stereo vision.

关 键 词：DELAUNAY三角剖分 结构体 链表 凸壳 

分 类 号：TP319[自动化与计算机技术—计算机软件与理论]