Covering Polygons with Rectangles

DOI10.1007/978-3-319-55911-7_20zbMath1485.68267OpenAlexW2558739083WikidataQ62039029 ScholiaQ62039029MaRDI QIDQ2988828

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (1)

Covering Polygons with Rectangles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering many or few points with unit disks
• Improved approximation algorithms for geometric set cover
• Solution approaches to irregular nesting problems
• Optimal packing and covering in the plane are NP-complete
• Optimal placement of convex polygons to maximize point containment
• Almost optimal set covers in finite VC-dimension
• Covering rectilinear polygons with axis-parallel rectangles
• Covering Polygons with Rectangles
• Approximation schemes for covering and packing problems in image processing and VLSI
• Covering Polygons Is Hard
• Experimental and Efficient Algorithms

This page was built for publication: Covering Polygons with Rectangles