Building a consensus: a rectangle covering problem

DOI10.1017/S0956796810000316MaRDI QIDQ3021417zbMATH OpenOpenAlexFDO

Authors Richard S. Bird

Publication date 25 July 2011

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796810000316

zbMATH Keywords

Schäfer-de Moor algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Functional programming and lambda calculus (68N18)

Recommendations

• A rectangular cover problem
• On rectangular covering problems
• The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
• An algorithm for covering polygons with rectangles
• scientific article; zbMATH DE number 29609

Cites work

• On Cores and Prime Implicants of Truth Functions

This page was built for publication: Building a consensus: a rectangle covering problem

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