Author:
Yang C. D.,Lee D. T.,Wong C. K.
Reference28 articles.
1. T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai. Visibility of disjoint polygons. Algorithmica, 1, 1986, pp.49–63.
2. B. Chazelle. Triangulating a simple polygon in linear time. Tech. Report CS-TR-264-90, Princeton Univ., 1990.
3. K. L. Clarkson, S. Kapoor, and P. M. Vaidya. Rectilinear shortest paths through polygonal obstacles in O(n log3/2 n) time. Submitted for publication.
4. M. de Berg, M. van Kreveld, B. J. Nillson, M. H. Overmars. Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric. Proc. of SWAT '90, Lect. Notes in Computer Science, 447, Springer-Verlag, 1990, pp.213–224.
5. P. J. deRezende, D. T. Lee, and Y. F. Wu. Rectilinear shortest paths with rectangular barriers. Discrete and Computational Geometry, 4, 1989, pp. 41–53.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献