Author:
Ntafos Simeon,Gewali Laxmi
Publisher
Springer Science and Business Media LLC
Subject
Computer Graphics and Computer-Aided Design,Computer Vision and Pattern Recognition,Software
Reference15 articles.
1. Agarwal PK, Aggarwal A, Aronov B, Kosaraju SR, Schieber B, Suri S (1991) Computing external farthest neighbors for a simple polygon. Discrete Appl Math 31: 97–111
2. Asano T, Asano T, Guibas L, Hershberger J, Imai H (1985) Visibility polygon search and euclidean shortest paths. In: Proceedings of the 1985 FOCS. IEEE Computer Society Press, Washington DC, pp 155–164
3. Avis D, Toussaint G (1981) an optimal algorithm for determining the visibility, of a polygon from an edge. IEEE Trans Comput, Vol C-30, no 12 pp 910–914
4. Proceedings of the 5th ACM Symposium on Computational Geometry;B Bhattacharya,1989
5. Chin WP, Ntafos S (1988) Optimum watchman routes. Inf Process Lett 28: 39–44
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献