Improved Bounds for Covering General Polygons with Rectangles
暂无分享,去创建一个
[1] David G. Kirkpatrick,et al. Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[2] D. Kleitman,et al. Covering Regions by Rectangles , 1981 .
[3] Micha Sharir,et al. Planar realizations of nonlinear davenport-schinzel sequences by segments , 1988, Discret. Comput. Geom..
[4] Andrzej Lingas,et al. Covering Polygons with Minimum Number of Rectangles , 1984, STACS.
[5] Christos Levcopoulos. A fast heuristic for covering polygons by rectangles , 1985, FCT.
[6] András Hegedüs. Algorithms for covering polygons by rectangles , 1982 .
[7] Joseph O'Rourke,et al. Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.
[8] Daniel J. Kleitman,et al. An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals , 1984, STOC '84.
[9] B. Chazelle. Computational geometry and convexity , 1980 .
[10] Ady Wiernik,et al. Planar realizations of nonlinear davenport-schinzel sequences by segments , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).