Covering polygons with rectangles
DOI10.1007/978-3-319-55911-7_20zbMATH Open1485.68267OpenAlexW2558739083WikidataQ62039029 ScholiaQ62039029MaRDI QIDQ2988828FDOQ2988828
Authors: Roland Glück 
Publication date: 19 May 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://elib.dlr.de/103759/1/EUROCG_2016.pdf
Recommendations
Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Solution approaches to irregular nesting problems
- Optimal placement of convex polygons to maximize point containment
- Almost optimal set covers in finite VC-dimension
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- Approximation schemes for covering and packing problems in image processing and VLSI
- Title not available (Why is that?)
- Covering rectilinear polygons with axis-parallel rectangles
- Optimal packing and covering in the plane are NP-complete
- Improved approximation algorithms for geometric set cover
- Covering Polygons Is Hard
- Covering many or few points with unit disks
- Covering polygons with rectangles
- Experimental and Efficient Algorithms
Cited In (10)
- Covering polygons with rectangles
- Periodic interlocking problems in \(\mathbb R\times[0,w]\)
- Covering a rectangle with equal circles
- Title not available (Why is that?)
- A rectangular cover problem
- Covering a convex polygon by triangles
- Covering of a rectangle with squares from both sides
- The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
- Covering a square by small perimeter rectangles
- Title not available (Why is that?)
This page was built for publication: Covering polygons with rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988828)
