This is my first post on here, so I hope you guys can help!
I am working on an optimisation problem concerning fitting homogeneous regular shapes (i.e. solar panels) within irregular shaped polygons (a standard house roof). I am looking to write a shape fitting algorithm. It wants to be as simple as possible to minimise computing time and of course be quick to code. I have written basic equations for standard roof shapes, but now I want to properly code something for all roof types.
Clearly to be universal the polygon (roof) shape will vary, but the nested shapes (solar panels) are all identical in size, in the same orientation throughout and the shapes are in straight rows.
Does anyone know if using a knapsack algorithm is an appropriate way to go or is this overcomplicating the optimisation problem to much?
