How to decompose a binary matrix into three hv-convex polyominoes

DOI10.1007/978-3-642-37067-0_27MaRDI QIDQ4924481zbMATH OpenOpenAlexFDO

Authors Andrea Frosini, Christophe Picouleau

Publication date 31 May 2013

Published in Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37067-0_27

zbMATH Keywords

computational complexitymatrix decompositionconvex polyomino

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)

Recommendations

• Minimum decomposition into convex binary matrices
• Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning
• Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy
• Decomposition of integer matrices and multileaf collimator sequencing
• Reconstruction of \(hv\)-convex binary matrices from their absorbed projections

Cited in

(2)

• A dual of the rectangle-segmentation problem for binary matrices
• Minimum decomposition into convex binary matrices

This page was built for publication: How to decompose a binary matrix into three \(hv\)-convex polyominoes

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