Algorithms for Rectangular Covering Problems

DOI10.1007/11751540_5MaRDI QIDQ5505317zbMATH OpenOpenAlexFDO

Authors Stefan Porschen

Publication date 27 January 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingclosure operatorinteger gridrectangular covering problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On rectangular covering problems
• Covering a point set by two disjoint rectangles
• On covering Z-grid points by rectangles
• Computational Science and Its Applications – ICCSA 2004
• An algorithm for covering polygons with rectangles

Cited in

(10)

• On covering Z-grid points by rectangles
• New heuristic algorithms for the rectangular p-cover problem
• On rectangular covering problems
• A hybrid heuristic for the rectilinear picture compression problem
• Algorithms for routing around a rectangle
• scientific article; zbMATH DE number 5790346 (Why is no real title available?)
• Angle covers: algorithms and complexity
• Efficient algorithms for the largest rectangle problem
• Computational Science and Its Applications – ICCSA 2004
• scientific article; zbMATH DE number 5291457 (Why is no real title available?)

This page was built for publication: Algorithms for Rectangular Covering Problems

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