Euclidean Shortest Path Problem with Rectilinear Obstacles

@article{Lim1993EuclideanSP,
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},
year={1993},
pages={90-93}
}

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