Author:
Lingas Andrzej,Wasylewicz Agnieszka,Żyliński Paweł
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Aggarwal, A.: The Art Gallery Theorem: Its Variations, Applications, and Algorithmic Aspects, Ph.D. Thesis, Johns Hopkins University (1984)
2. Carlsson, S., Nilsson, B.J., Ntafos, S.C.: Optimum guard covers and m-watchmen routes for restricted polygons. Int. J. Comput. Geometry Appl. 3(1), 85–105 (1993)
3. Chazelle, B.M., Dobkin, D.: Decomposing a polygon into convex parts. In: Proc. 11th ACM Symp. on Theory of Comput., pp. 38–48 (1979)
4. Culberson, J.C., Reckhow, R.A.: A unified approach to orthogonal polygon covering problems via dent diagrams, Technical Report TR 89-06, University of Alberta (1989)
5. Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. J. Algorithms 17(1), 2–44 (1994)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献