Euclidean Shortest Path Problem with Rectilinear Obstacles

  title={Euclidean Shortest Path Problem with Rectilinear Obstacles},
  author={J. Lim and S. Iyengar and S. Zheng},
  journal={The Sixth International Conference on VLSI Design},
  • J. Lim, S. Iyengar, S. Zheng
  • Published 1993
  • Mathematics, Computer Science
  • The Sixth International Conference on VLSI Design
  • This paper presents new heuristic algorithms using the guided A* search method : Guided Minimum Detour (GMD) algorithm and Line-by-Line Guided Minimum Detour (LGMD) algorithm for finding optimal rectilinear (L,) shortest paths in the presence of rectilinear obstacles. The GMD algorithm runs O(nhr(1ogN) + tN) in time and takes O(N) in space, where N is the number of extended line segments including boundary of the obstacle; and t is the number of intersected boundary of the obstacles on the… CONTINUE READING
    2 Citations


    Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
    • 117
    Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time
    • 135
    • PDF
    Rectilinear shortest paths in the presence of rectangular barriers
    • 79
    • PDF
    A shortest path algorithm for grid graphs
    • 123
    Rectilinear shortest paths with rectangular barriers
    • 76
    An Algorithm for Path Connections and Its Applications
    • C. Y. Lee
    • Computer Science
    • IRE Trans. Electron. Comput.
    • 1961
    • 1,414
    • PDF
    A solution to line-routing problems on the continuous plane
    • 233
    Fast Maze Router
    • J. Soukup
    • Mathematics, Computer Science
    • 15th Design Automation Conference
    • 1978
    • 179
    • PDF
    Heuristic Search Viewed as Path Finding in a Graph
    • I. Pohl
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1970
    • 358
    • PDF