Geometric routing technique in AUTOCAD: Auto Lisp algorithm for the shortest path

This paper presents a new approach to determine the shortest path between two points in AUTOCAD using Auto LISP for cabling purposes. The algorithm is initialized by setting the origin and destination points and uses a series of intermediate points to approximate the optimal path. These points are iteratively refined through error minimization to ensure trajectory accuracy. The algorithm calculates the total distance of the shortest path and visually shows it with a red line. This method effectively handles complex environments with multiple obstacles and provides a computationally efficient solution for routing in AUTOCAD.