I'm looking to an algorithm to covering maximum surface of a polygon with rectangles. Rectangles have to have a specific width, a rectangle can't overlap an other one and each one has to fit in the polygon. I've already looking for other posts but I couldn't find an algo without overlap or specific width.

Thanks for your help

I'm looking to an algorithm to covering maximum surface of a polygon with rectangles. Rectangles have to have a specific width, a rectangle can't overlap an other one and each one has to fit in the polygon. I've already looking for other posts but I couldn't find an algo without overlap or specific width.

Note: The length can be different for any rectangle and rectangles can point in different directions.

Thanks for your help

I'm looking to an algorithm to covering maximum surface of a polygon with rectangles. Rectangles have to have a specific width and a rectangle can't overlap an other one. I've already looking for other posts but I couldn't find an algo without overlap or specific width.

Thanks for your help

I'm looking to an algorithm to covering maximum surface of a polygon with rectangles. Rectangles have to have a specific width, a rectangle can't overlap an other one and each one has to fit in the polygon. I've already looking for other posts but I couldn't find an algo without overlap or specific width.

Thanks for your help