Covering polygons is hard
暂无分享,去创建一个
[1] Bernard Chazelle,et al. Decomposing a polygon into its convex parts , 1979, STOC.
[2] J. Mark Keil,et al. Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..
[3] Andrzej Lingas,et al. The Power of Non-Rectilinear Holes , 1982, ICALP.
[4] Joseph C. Culberson,et al. Orthogonally Convex Coverings of Orthogonal Polygons without Holes , 1989, J. Comput. Syst. Sci..
[5] D. Kleitman,et al. Covering Regions by Rectangles , 1981 .
[6] Rajeev Motwani,et al. Covering orthogonal polygons with star polygons: the perfect graph approach , 1988, SCG '88.
[7] Daniel J. Kleitman,et al. An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals , 1984, STOC '84.
[8] J. Mark Keil. Minimally covering a horizontally convex orthogonal polygon , 1986, SCG '86.
[9] Joseph O'Rourke,et al. Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.