Covering Polygons with Rectangles

@inproceedings{Glck2017CoveringPW,
  title={Covering Polygons with Rectangles},
  author={Roland Gl{\"u}ck},
  booktitle={TAMC},
  year={2017}
}
A well-known and well-investigated family of hard optimization problems deals with nesting, i.e., the non-overlapping placing of polygons to be cut from a rectangle or the plane whilst minimizing the waste. Here we consider the in some sense inverse problem of a subsequent step in production technology: given a set of polygons in the plane and an axis-aligned rectangle (modeling a gripping device), we seek the minimum number of copies of the rectangle such that every polygon is completely… 

Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-dimension

TLDR
A deterministic polynomial-time O(log z^*_F)-approximation algorithm for guarding (1-delta)-fraction of the area of any given simple polygon, with running time proportional to polylog(1/delta).

Reduced-Complexity Algorithms for Indoor Map-Aware Localization Systems

TLDR
Two novel strategies for restricting the search domain of map-aware position estimators are developed and the exploitation of state-of-the-art numerical integration and optimization methods is investigated, leading to the development of a new family of suboptimal map- aware localization algorithms.

TAILOR-MADE THERMOPLASTICS:PRODUCTION TECHNOLOGY AND QUALITY ASSURANCE OF A THERMOPLASTIC AIRCRAFT FUSELAGE SKIN SEGMENT

The production of carbon fiber reinforced plastic (CFRP) parts for aircrafts is very time and cost intensive. To be able to compete with metal based technologies both the area of application as well

Conflict Detection in Rule Based IoT Systems

TLDR
This paper introduces a rule conflict mechanism with three categories to detect conflicting and incomplete rules, and introduces a method to detect incomplete rules.

References

SHOWING 1-10 OF 17 REFERENCES

Rectangle covers revisited computationally

TLDR
An integer program is proposed which is the first general approach to obtain provably optimal solutions to this well-studied NP-hard problem of covering an orthogonal polygon with a minimum number of axis-parallel rectangles and a stronger lower bound on the optimum, namely, the cardinality of a fractional stable set is proposed.

Optimal Packing and Covering in the Plane are NP-Complete

Optimal placement of convex polygons to maximize point containment

Covering Many or Few Points with Unit Disks

TLDR
An algorithm is presented that computes, for any fixed ε>0, in O(nlog 2n) expected time a disk that is, with high probability, a (1+ε)-approximation to the optimal solution.

Covering polygons is hard

  • J. CulbersonR. Reckhow
  • Mathematics, Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
It is shown that the following minimum cover problems are NP-hard, even for polygons without holes, and these results hold even if the polygons are required to be in general position.

Approximation schemes for covering and packing problems in image processing and VLSI

TLDR
The unified technique that is introduced here, referred to as the shifting strategy, is applicable to numerous geometric covering and packing problems and how it varies with problem parameters is illustrated.

Almost optimal set covers in finite VC-dimension

We give a deterministic polynomial-time method for finding a set cover in a set system (X, ℛ) of dual VC-dimensiond such that the size of our cover is at most a factor ofO(d log(dc)) from the optimal

Covering rectilinear polygons with axis-parallel rectangles

TLDR
This is the first polynomial time approximation algorithm for this problem with an O(\sqrt n) factor approximation factor for covering a rectilinear polygon with holes using axis-parallel rectangles.