基于中心线的双线巷道自动生成算法与实现

Algorithm for generation of double-line laneway automatically based on media line and its implementation

提出双线巷道的自动生成解决方案:对巷道中心线进行求交点、打断操作,生成节点—路径网络拓扑图;根据外层路径优先搜索原则,提取图中所有的闭环,根据路径的断面底板宽度,对闭环的边界路径进行偏移、前后联结操作,最终生成交叉点处下行巷道遮挡部分消隐和相交节点处贯通的双线巷道。该算法充分利用节点—路径的拓扑关系,实现简单、速度较快,适用于任意复杂情况下不等宽双线巷道的自动生成。

This paper proposed an algorithm for generation of double-line laneway based on media lines. Constructed nodepath graph according to the broken up curves generated by intersection points of media lines, made correct judgment for space position of laneways and made automatic hiding and elimination of disposal for the juncture and intersection of media lines, picked up all closed loops though outer path tracing prior principle, built double-line laneway after offset calculation and connection of boundary path. In the algorithm, the topology of the vertexes and paths made full use of so as to reduce calculation task, simplify implementation and made it suitable for any complicated cases.