Author:
Lu Bor-Kuan,Hsu Fang-Rong,Tang Chuan Yi
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference10 articles.
1. Optimally computing the shortest weakly visible subedge of a simple polygon;Chen;J. Algorithms,1996
2. Optimal linear-time algorithm for the shortest illuminating line segment in a polygon;Das,1994
3. Finding all weakly-visible chords of a polygon in linear time;Das;Nordic J. Comput.,1994
4. An algorithm for determine visibility of a simple polygon from an internal line segment;Doh;J. Algorithms,1993
5. Detecting the weak visibility of a simple polygon and related problems, Technical Report;Ke,1987
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献