Abstract
The rectilinear polygon cover problem is one in which a certain class of features of a rectilinear polygon ofn vertices has to be covered with the minimum number of rectangles included in the polygon. In particular, we consider covering the entire interior, the boundary, and the set of corners of the polygon. These problems have important applications in storing images and in the manufacture of integrated circuits. Unfortunately, most of these problems are known to be NP-complete. Hence it is necessary to develop efficient heuristics for these problems or to show that the design of efficient heuristics is impossible. In this paper we show:
-
(a)
The corner cover problem is NP-complete.
-
(b)
The boundary and the corner cover problem can be approximated within a ratio of 4 of the optimum inO(n logn) andO(n 1.5) time, respectively.
-
(c)
No polynomial-time approximation scheme exists for the interior and the boundary cover problems, unless P=NP.
Access this article
Rent this article via DeepDyve
Similar content being viewed by others
References
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof Verification and Hardness of Approximation Problems.Proc. 33rd IEEE Symp. on Foundations of Computer Science (FOCS) 1992, pp. 14–23.
P. Berman and B. DasGupta. Results on Approximation of the Rectilinear Polygon Cover Problems. Tech. Rep. #CS-92-06, Pennsylvania State University, June, 1992.
P. Berman and G. Schnitger. On the Complexity of Approximating the Independent Set Problem.Inform. and Comput., 96 (1992), 77–94.
S. Chaiken, D. J. Kleitman, M. Saks, and J. Shearer. Covering Regions by Rectangles.SIAM J. Algebraic Discrete Methods, 2 (1981), 394–410.
H. E. Conn and J. O'Rourke. Some Restricted Rectangle Covering Problems. Tech Rep. JHU-87/13, Johns Hopkins University, Baltimore, MD, 1987. Also appeared inProc. Allerton Conference, 1987, pp. 898–907.
T. H. Corman, C. E. Leiserson, and R. L. Rivest.Introduction to Algorithms. MIT Press, Cambridge, MA 1990.
J. C. Culberson and R. A. Reckhow. Covering Polygon Is Hard.J. Algorithms, 17 (1994), 2–44.
D. S. Franzblau. Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles.SIAM J. Discrete Math., 2 (1989), 307–321.
D. S. Franzblau and D. J. Kleitman. An Algorithm for Covering Polygons with Rectangles.Inform. and Control, 63(3) (1984), 164–189.
M. R. Garey and D. S. Johnson.Computers and Intractability—A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
J. E. Hopcroft and R. M. Karp. Ann 5/2 Algorithm for Maximum Matching in Bipartite Graphs.SIAM J. Comput., 2 (1979), 225–231.
A. Lubiw. Ordering and Some Combinatorial Optimization Problems with Some Geometric Applications. Ph.D. Thesis, University of Waterloo, Ontario, 1985.
A. Lubiw. The Boolean Basis Problem and How to Cover Polygons by Rectangles. Manuscript, University of Waterloo, Ontario, 1988. Referenced in [8]. D. S. Franzblau. Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles.SIAM J. Discrete Math., 2 (1989), 307–321.
W. J. Masek. Some NP-Complete Set Covering Problems. Unpublished manuscript, MIT, Cambridge, MA. Referenced in [10]. M. R. Garey and D. S. Johnson.Computers and Intractability—A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
C. Mead and L. Conway.Introduction to VLSI Systems. Addison-Wesley, Reading, MA, 1980, Chapters 2 and 4.
R. Motwani, A. Raghunathan, and H. Saran. Perfect Graphs and Orthogonally Convex Covers.SIAM J. Discrete Math., 2 (1989), 371–392.
T. Ohtsuki. Minimum Dissection of Rectilinear Polygons.Proc. IEEE Symp. on Circuits and Systems, 1982, pp. 1210–1213.
J. O'Rourke and K. J. Supowit. Some NP-Hard Polygon Decomposition Problems.IEEE Trans. Inform. Theory, 29 (1983), 181–190.
L. Pagli, E. Lodi, F. Luccio, C. Mugnai, and W. Lipski. On Two-Dimensional Data Organization 2.Fund. Inform., 2 (1979), 211–226.
C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation and Complexity Classes.J. Computer System Sci., 43 (1991), 425–440.
Author information
Authors and Affiliations
Additional information
Communicated by C. K. Yap.
A preliminary version of this result appeared inProceedings of the Fourth Canadian Conference on Computational Geometry, 1992, pp. 229–235. This research was partially supported by NSF Grant CCR-9114545.
Rights and permissions
About this article
Cite this article
Berman, P., DasGupta, B. Complexities of efficient solutions of rectilinear polygon cover problems. Algorithmica 17, 331–356 (1997). https://doi.org/10.1007/BF02523677
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02523677