Rectilinear Path Problems among Rectilinear Obstacles Revisited

@article{Yang1995RectilinearPP,
  title={Rectilinear Path Problems among Rectilinear Obstacles Revisited},
  author={Chung-Do Yang and D. T. Lee and Chak-Kuen Wong},
  journal={SIAM J. Comput.},
  year={1995},
  volume={24},
  pages={457-472}
}
We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear path, we use graph-theoretic approach and obtain an algorithm with O(m logt + t log 3=2 t) running… CONTINUE READING

From This Paper

Topics from this paper.
24 Citations
1 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…