Abstract

Lee's algorithm (1961) for routing always finds a minimum length path, if one exists. We discuss an enhancement to an earlier maze-routing algorithm to reduce the number of zig-zag line segments in the routing path. This method would find a path between two points, if one exists, on a rectangular grid of cells. A line search method using efficient data structures has been applied that would reduce the number of line segments in the path. Blocking cells are introduced as obstacles in finding the path. All line segments are considered as horizontal and vertical only. An implementation of the method and its experimental results are reported.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.