Author:
Lingas Andrzej,Wasylewicz Agnieszka,Żyliński Paweł
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference20 articles.
1. A. Aggarwal, The art gallery theorem: its variations, applications, and algorithmic aspects, PhD thesis, Johns Hopkins University, 1984
2. B.M. Chazelle, D. Dobkin, Decomposing a polygon into convex parts, in: Proc. 11th ACM Symposium on the Theory of Computing, 1979, pp. 38–48
3. J.C. Culberson, R.A. Reckhow, A unified approach to orthogonal polygon covering problems via dent diagrams, Technical Report TR 89-06, University of Alberta, 1989
4. Covering polygons is hard;Culberson;Journal of Algorithms,1994
5. D.S. Franzblau, D.J. Kleitman, An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals, in: Proc. 16th ACM Symposium on the Theory of Computing, 1984, pp. 167–174
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献