A Dual of the Rectangle-Segmentation Problem for Binary Matrices Journalartikel uri icon

 

Abstract

  • We consider the problem to decompose a binary matrix into a small number of binary matrices whose 1-entries form a rectangle. We show that the linear relaxation of this problem has an optimal integral solution corresponding to a well known geometric result on the decomposition of rectilinear polygons.

Veröffentlichungsjahr

  • 2009

Zugangsrechte

  • Open Access

Heftnummer

  • 1

Band

  • 16