集成距离变换和区域邻接图生成Delaunay三角网的方法研究  

A Method for Delaunay Triangulation by Integration of Distance Transformation and Region Adjacency Graphics

作　　者：沈晶[1] 刘纪平[1] 林祥国[1] 赵荣[1] 

机构地区：[1]中国测绘科学研究院

出　　处：《武汉大学学报（信息科学版）》2012年第8期1000-1003,共4页Geomatics and Information Science of Wuhan University

基　　金：国家863计划资助项目(G7910);国家自然科学基金资助项目(41001280);国家973计划资助项目(2006CB701303);中央级公益性科研院所基本科研业务费专项资金资助项目(7771025);中国博士后基金资助项目(2010047038)

摘　　要：基于距离变换和区域邻接图,提出了一种D-TIN(包括约束的D-TIN)的生成方法。利用D-TIN是Voronoi图的几何对偶这一特性,使用距离变换获取点的Voronoi图,使用区域邻接图获取点在该Voronoi图上的空间邻接关系,以生成D-TIN或者约束的D-TIN。实验表明,与经典的基于数学形态学生成的D-TIN和约束D-TIN的方法相比,本文算法可以分别提高约57.70%和56.64%的效率。A method for D-TIN or constrained D-TIN generation by integration of distance transformation （DT） and region adjacency graphics （RAG） is proposed. Its basic idea is that Delaunay triangulation is the dual structure of the Voronoi diagram. Concretely, DT is used to obtain Voronoi diagram while RAG is used to find spatial relationships between discrete points on building Voronoi diagram, which is helpful to from the D-TIN. Compared to the typical method with which mathematical morphology is used, our proposed method is capable of increasing the efficiencies approximately 57.70% and 56.64% on average for D-TIN and constrained D-TIN generation respectively.

关 键 词：距离变换 区域邻接图 Delaunay不规则三角网 VORONOI图 数学形态学 

分 类 号：P208[天文地球—地图制图学与地理信息工程]