摘要
鉴于道路中心线应用的广泛性,研究了基于约束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.
引文
[1]Shaked D,Bruckstein A M.The curve axis[J].Computer Vision and Image Understanding,1996,63(2):367-369.
[2]LI Z L.Algorithmic Foundation of Multi-scale Spatial Representation[M].CRC Press,2007:20-23.
[3]Attneav E F.Some informational aspects of visual perception[J].Psychological Review,1954,61(3):183-193.
[4]Mcmaster R B.A statistical analysis of mathematical measures for line simplification[J].The American Cartographer,1986,13:103-116.
[5]Mcmaster R B.Automated line generalization[J].Cartographica,1987,24(2):74-111.
[6]LI Z L.An examination of algorithms for detection of critical points on digital lines[J].The Cartographic Journal,1995,32(2):121-125.
[7]Haunert J H,Sester M.Area Collapse and Road Centerlines based on Straight Skeletons[J].Geoinformatica,2008,12:169-191.
[8]Paul C L.Constrained Delaunay Triangulations[J].Algorithmica,1989,4:97-108.