Timeline for Algo for covering maximum surface of a polygon with rectangles
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 22, 2016 at 6:39 | history | edited | Antoine L. | CC BY-SA 3.0 |
added 106 characters in body
|
| Jul 22, 2016 at 6:39 | comment | added | Antoine L. | The length can be different for any rectangle and rectangles can point in different directions. I'll try searching with this keyword. Thanks @GerryMyerson | |
| Jul 21, 2016 at 13:03 | answer | added | Joseph O'Rourke | timeline score: 4 | |
| Jul 20, 2016 at 23:15 | comment | added | Gerry Myerson | stackoverflow.com/questions/3303689/… might also be helpful. | |
| Jul 20, 2016 at 23:12 | comment | added | Gerry Myerson | Still not clear. The rectangles all have the same, given, width, but the lengths can be different and arbitrary? Must the rectangles all be aligned, or can they all point in different directions? Anyway, this is a packing problem, and maybe that keyword will aid your search. But optimal packing algorithms are few and far between, you may have to settle for considerably less than the maximum area, or for a really slow algorithm. gamedev.stackexchange.com/questions/27055/… might be helpful. | |
| Jul 20, 2016 at 20:35 | comment | added | Antoine L. | Thanks @JosephO'Rourke. Youre were right, I edited my question. | |
| Jul 20, 2016 at 20:34 | history | edited | Antoine L. | CC BY-SA 3.0 |
added 36 characters in body
|
| Jul 20, 2016 at 20:16 | comment | added | Joseph O'Rourke | I don't think your question is well-posed. Why not just take sufficiently long rectangles and stack them one on top of another until your polygon is covered? Perhaps you mean: Each rectangle must fit inside the polygon? | |
| Jul 20, 2016 at 18:37 | history | edited | Michael Albanese | CC BY-SA 3.0 |
edited tags; edited title
|
| Jul 20, 2016 at 18:36 | review | First posts | |||
| Jul 20, 2016 at 18:37 | |||||
| Jul 20, 2016 at 18:31 | history | asked | Antoine L. | CC BY-SA 3.0 |