Close approximations of minimum rectangular coverings
Author
Summary, in English
We consider the problem of covering arbitrary polygons with rectangles. The rectangles must lie entirely within the polygon. (This requires that the interior angles of the polygon are all greater than or equal to 90 degrees.) We want to cover the polygon with as few rectangles as possible. This problem has an application in fabricating masks for integrated circuits.
In this paper we will describe the first polynomial algorithm, guaranteeing an O(log n) approximation factor, provided that the n vertices of the input polygon are given as polynomially bounded integer coordinates. By the same technique we also obtain the first algorithm producing a covering which is within a constant factor of the optimal in exponential time (compared to the doubly-exponential known before).
In this paper we will describe the first polynomial algorithm, guaranteeing an O(log n) approximation factor, provided that the n vertices of the input polygon are given as polynomially bounded integer coordinates. By the same technique we also obtain the first algorithm producing a covering which is within a constant factor of the optimal in exponential time (compared to the doubly-exponential known before).
Department/s
- Computer Science
Publishing year
1996
Language
English
Pages
135-146
Publication/Series
Foundations of software technology and theoretical computer science : 16th Conference / Lecture notes in computer science
Volume
1180
Full text
- Available as AI - 252 kB
- Download statistics
Document type
Conference paper
Publisher
Springer
Topic
- Computer Science
Status
Published
ISBN/ISSN/Other
- ISBN: 3540620346