一种基于约束三角网的道路中心线的提取方法  

Extraction Method of Road Centerline Based on Constrained Delaunay Triangulation

作　　者：李功权[1] 蔡祥云[1] 

机构地区：[1]长江大学地球科学学院,湖北武汉430100

出　　处：《长江大学学报（自科版）（上旬）》2013年第2期47-50,共4页JOURNAL OF YANGTZE UNIVERSITY (NATURAL SCIENCE EDITION) SCI ＆ ENG

基　　金：中国石油科技创新基金(2010D-5006-0205)

摘　　要：鉴于道路中心线应用的广泛性,研究了基于约束Delaunay三角网的道路中心线的提取算法。以道路边界线作为约束线,采用Delaunay方法构建三角网。通过确定相邻三角形的类型,把获取的节点分为3类,其对应道路网络中的十字路、T型路和环岛路,对其分别进行优化处理,从而形成道路的中心线。在给出详细的算法步骤的同时,并用C#语言实现该算法。实测数据应用分析表明,该算法生成的道路中心线符合原道路多边形的形态,保持了原图形的拓扑特征。In view of wide application of road centerline,its extraction algorithm is studied based on the constrained Delaunay triangulation.The constrained Delaunay method is taken to construct the triangular mesh.Three categories of adjacent triangles are determined to obtain the node of the road network.So crossroads,T-shaped road and the road around the island can be optimized to construct center line of the road.Details of steps of the algorithm are discussed.The road centerline generated by the algorithm maintains the topological characteristics of the original graphic that can be concluded by analysis of the measured data.

关 键 词：道路中心线 约束Delaunay三角网 道路网络模型 

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