一种新的基于中心线的双线巷道自动生成算法

A New Algorithm of Automatic Generation of Double-line Laneway Based on Centerline

  • 摘要: 针对目前双线巷道自动生成算法存在的问题,提出了一种新的基于中心线的双线巷道自动生成算法。该算法实现原理:由巷道中心线分别向两侧偏移巷道宽度的1/2距离,生成不等宽的双线巷道,双线首尾相接再生成多边形区域;任取两条巷道,求一条巷道的多边形区域与另一条巷道的双线的交点,并判断相邻两交点之间的双线是否在多边形区域内,若在多边形区域内,且一条巷道在另一条巷道的上方或相互贯通,则裁剪掉这部分双线巷道;遍历所有巷道使两两之间都经过这种方法处理,最终生成相互贯通或交叉的双线巷道图。

     

    Abstract: In view of problems existed in current algorithm of automatic generation of double-line laneway, the paper proposed a new algorithm of automatic generation of double-line laneway based on centerline. The principle of the algorithm is as follows: offsetting 1/2 of laneway width from laneway centerline to both sides to generate double-line laneways with different widths, connecting initial and ending of the double-line to form polygon area; selecting two laneways arbitrarily, finding intersection points of polygon area of one laneway and double-line of another laneway and judging whether double-line between two adjacent points is in region of the polygon area, if it is in the region and one laneway is above another laneway or both laneways are interpenetrate, then clipping the double-line laneway; traversing and processing all laneways by use of the above method, which can generate interpenetrate or crossed double-line laneway graph.

     

/

返回文章
返回