Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Alsuwaiyel, M.H., Lee, D.T.: Finding an approximate minimum-link visibility path inside a simple polygon. Inf. Proc. Lett. 55(2), 59–79 (1995)
2. Amit, Y., Mitchell, J., Packer, E.: Locating guards for visibility coverage of polygons. In: Workshop on Algorithm Engineering and Experiments, ALENEX (2007)
3. Arkin, E., Mitchell, J., Piatko, C.: Minimum-link watchman tours. Technical Report, University at Stony Brook (1994)
4. Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proc. 8th Canad. Conf. Computat. Geometry (1996)
5. Carlsson, S., Jonsson, H., Nilsson, B.J.: Finding the shortest watchman route in a simple polygon. In: ISAAC: 4th International Symposium on Algorithms and Computation (formerly SIGAL International Symposium on Algorithms), Organized by Special Interest Group on Algorithms (SIGAL) of the Information Processing Society of Japan (IPSJ) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers (IEICE)) (1993)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献