Publisher
Springer Berlin Heidelberg
Reference52 articles.
1. T. Asano, T. Asano, L. Guibas, J. Hershberger and H. Imai, “Visibility of disjoint polygons,” Algorithmica, 1, 1986, 49–63.
2. T. Asano, “Generalized Manhattan path algorithm with applications,” IEEE Trans. CAD, 7, 1988, 797–804.
3. T. Asano, M. Sato and T. Ohtsuki, “Computational geometry algorithms,” in Layout Design and Verification, (T. Ohtsuki Ed.), North-Holland, 1986, 295–347.
4. M. J. Atallah and D. Z. Chen, “Parallel rectilinear shortest paths with rectangular obstacles,” Computational Geometry: Theory and Applications, 1, 2, 1991, 79–113.
5. B. Chazelle, “Triangulating a simple polygon in linear time,” Proc. 31st FOCS, Oct. 1990, 220–230.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献