algorithm - Filling rectilinear polygon (with holes) with rectangles -

algorithm - Filling rectilinear polygon (with holes) with rectangles -

i read np problem.

but don't need smallest number of rectangles. "more or less" algorithm.

so, problem.

i have binary pixel matrix, similar this: http://en.wikipedia.org/wiki/connected-component_labeling#mediaviewer/file%3ascreenshot-pixel_region_%28figure_1%29.png

i need fill 1's. can't draw pixel pixel. planned cover part rectangles , fill rectangles.

can help me?

problem polynomial in 2d case, np-complete in 3d. shown in paper.

idea of algorithm, 2d case, cut down problem maximum matching of bipartite graph (vertices possible cuts.) take on page or presentation.

algorithm graphics computational-geometry graph-algorithm np