路线外一点对应路线中桩算法研究

摘要

Solving the corresponding route stake number of the point outside the route is a common problem ,and is also the basis for the interchange nose point designing program .The quality of the algorithm has immediate impacts on the overall program's efficiency .Based on route stake coordinate calculation and point to the tangent line at any point of the pedal algorithm ,this paper puts forward a new algorithm ,which can be applied to all kinds of complex horizontal a-lignment and neglects the initial stake .The algorithm can one-off search multiple corresponding route stake numbers , which provides an important basis for the interchange program design .%求解路线外一点对应的路线中桩和距离是路线和立交设计程序中经常遇到的问题，也是互通式立交端部搜索设计程序的基础。其算法的好坏直接影响到整个程序的运行效率。基于路线中桩坐标计算和点到路线上任一点切线方向的垂足算法，提出了1种适用于各种复杂平面线形，不考虑初始桩号，可以同时搜索多个对应桩号的算法，这一算法具有计算效率高，收敛速度快特点，为互通式立交程序化设计提供了重要依据。