Author:
Choi Seung-Hak,Shin Sung Yong,Chwa Kyung-Yong
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference24 articles.
1. T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai, Visibility of disjoint polygons,Algorithmica,1 (1986), 49?63.
2. J. Abello, O. Egecioglu, and K. Kumar, Visibility graphs of staircase polygons and the weak Bruhat order, I: From visibility graphs to maximal chains,Discrete Comput. Geom., to appear.
3. J. Abello, O. Egecioglu, and K. Kumar, Visibility graphs of staircase polygons and the weak Bruhat order, II: From maximal chains to polygons,Discrete Comput. Geom., to appear.
4. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
5. D. Avis and G. T. Toussaint, An optimal algorithm for determining the visibility of a polygon from an edge,IEEE Trans. Comput., 30(12) (1981), 910?914.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献