### Abstract

The rectilinear polygon cover problem is one in which a certain class of features of a rectilinear polygon of n 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 in O(n logn) and O(n1.5) time, respectively. (c) No polynomial-time approximation scheme exists for the interior and the boundary cover problems, unless P = NP.

Original language | English (US) |
---|---|

Pages (from-to) | 331-356 |

Number of pages | 26 |

Journal | Algorithmica (New York) |

Volume | 17 |

Issue number | 4 |

DOIs | |

State | Published - Apr 1997 |

### All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Computer Science Applications
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems'. Together they form a unique fingerprint.

## Cite this

*Algorithmica (New York)*,

*17*(4), 331-356. https://doi.org/10.1007/BF02523677