基于方位角夹角的三岔路口道路中线优化算法

An Optimized Algorithm of T-Shaped Road Junction Center-Lines Based on the Cut Angle of Azimuths

基于约束Delaunay三角网法是从已有面状道路图层数据中自动获取道路中线的常用算法.根据此算法得到的岔路口处的道路中线需要进一步优化处理,三岔路口道路中线的优化处理为其中问题之一.提出了方位角夹角的概念和基于方位角夹角三岔路口道路中线的优化处理算法,根据三岔路口三条道路中线的方位角夹角的大小,求取岔路口中线交点,实现三岔路口的道路中线的优化处理.

Constrained Delaunay Triangulation （CDT） is a conventional algorithm for extracting centerlines from the available data of road layers. The center-lines of roads at a road junction extracted by CDT algorithm need to be optimized, which is one of the key issues for the optimization of the center-lines at a T-shaped road junction. This paper introduces a new concept of ＂the included angle of azimuth＂ to solve the problem and presents the algorithm for T-shaped road junction center-line optimization. According to this algorithm, the intersecting point can be calculated by comparing the included angle of azimuth angle of the three center lines in an intersection road, so as to accomplish T-shaped road junction center-lines optimization.