A linear-time heuristic for minimum rectangular coverings (Extended abstract)

DOI10.1007/BFB0036193MaRDI QIDQ5055944zbMATH OpenFDO

Authors Joachim Gudmundsson, Christos Levcopoulos

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0036193

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Close approximations of minimum rectangular coverings
• scientific article; zbMATH DE number 3918386
• Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
• COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME
• Covering rectilinear polygons with axis-parallel rectangles

Cites work

• A linear-time heuristic for minimum rectangular coverings (Extended abstract)
• Covering Polygons Is Hard
• scientific article; zbMATH DE number 3918386 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
• Some NP-hard polygon decomposition problems

Cited in

(10)

• Close approximations of minimum rectangular coverings
• Covering rectilinear polygons with axis-parallel rectangles
• Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
• COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME
• Covering Rectilinear Polygons with Axis-Parallel Rectangles
• An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
• New heuristic algorithms for the rectangular p-cover problem
• scientific article; zbMATH DE number 5790346 (Why is no real title available?)
• A linear-time heuristic for minimum rectangular coverings (Extended abstract)
• Experimental and Efficient Algorithms

This page was built for publication: A linear-time heuristic for minimum rectangular coverings (Extended abstract)

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