论文信息 - Covering of polygons by rectangles - 字舞流文

Covering of polygons by rectangles

F. Cheng | I.-M. Lin

[1] K. Patel,et al. Computer-aided decomposition of geometric contours into standardized areas , 1977 .

[2] Lynn Conway,et al. Introduction to VLSI systems , 1978 .

[3] András Hegedüs. Algorithms for covering polygons by rectangles , 1982 .

[4] 室賀三郎. VLSI system design : when and how to design very-large-scale integrated circuits , 1982 .

[5] Witold Lipski,et al. Finding a manhattan path and related problems , 1983, Networks.

[6] Kevin D. Gourley,et al. A Polygon-to-Rectangle Conversion Algorithm , 1983, IEEE Computer Graphics and Applications.

[7] Joseph O'Rourke,et al. Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[8] J. Kahn,et al. Traditional Galleries Require Fewer Watchmen , 1983 .

[9] Daniel J. Kleitman,et al. An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals , 1984, STOC '84.

[10] J. Mark Keil,et al. Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..

[11] B. Chazelle,et al. Optimal Convex Decompositions , 1985 .

[12] J. Mark Keil. Minimally covering a horizontally convex orthogonal polygon , 1986, SCG '86.

[13] Takao Asano,et al. Efficient Algorithms for Geometric Graph Search Problems , 1986, SIAM J. Comput..

[14] Joseph C. Culberson,et al. Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons , 1987, SCG '87.