Author:
Carlsson Svante,Nilsson Bengt J.,Ntafos Simeon
Reference13 articles.
1. A. Aggarwal. The Art Gallery Theorem: Its variations, applications and algorithmic aspects. PhD thesis, Johns Hopkins University, 1984.
2. W. Chin, S. Ntafos. Shortest Watchman Routes in Simple Polygons. Technical Report, Dept. of Computer Science, Univ. of Texas at Dallas, 1987.
3. W. Chin, S. Ntafos. Optimum Watchman Routes. Information Processing Letters, 28:39–44, 1988.
4. J.C. Culberson, R.A. Reckhow. Covering Polygons is Hard. In Proc. 29th Symposium on Foundations of Computer Science, pages 601–611, 1988.
5. B. Chazelle. Triangulating a Simple Polygon in Linear Time. In Proc. 31st Symposium on Foundations of Computer Science, pages 220–230, 1990.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献