Close approximations of minimum rectangular coverings

DOI10.1023/A:1009879504783zbMATH Open0961.90132OpenAlexW1854088420MaRDI QIDQ1970337FDOQ1970337

Authors: Christos Levcopoulos, Joachim Gudmundsson 

Publication date: 4 September 2000

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009879504783

Recommendations

• scientific article; zbMATH DE number 4049039
• scientific article; zbMATH DE number 3872705
• scientific article; zbMATH DE number 3893101
• A linear-time heuristic for minimum rectangular coverings (Extended abstract)
• scientific article; zbMATH DE number 3918386

zbMATH Keywords

computational geometryapproximation algorithmscovering polygons

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (27)

• Approximation schemes for covering and packing problems in image processing and VLSI
• Title not available (Why is that?)
• Title not available (Why is that?)
• Close approximations of minimum rectangular coverings (extended abstract)
• Covering polygons with rectangles
• Covering Rectilinear Polygons with Axis-Parallel Rectangles
• Title not available (Why is that?)
• OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
• Smallest \(k\)-enclosing rectangle revisited
• Title not available (Why is that?)
• A linear-time heuristic for minimum rectangular coverings (Extended abstract)
• Title not available (Why is that?)
• Drawing borders efficiently
• Title not available (Why is that?)
• An algorithm for covering polygons with rectangles
• A translational rectangular covering
• Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast approximation algorithms for a nonconvex covering problem
• Covering rectilinear polygons with axis-parallel rectangles
• Experimental and Efficient Algorithms
• Beyond triangulation: covering polygons with triangles
• An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee

This page was built for publication: Close approximations of minimum rectangular coverings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970337)