Timeline for Optimally placing rectangles with obstacles
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2017 at 5:54 | comment | added | Manfred Weis | maybe not unrelated: the problem of "Squaring the Square", which is partitioning a square into a set of unequal squares. There is a chapter in Bollobas book "Modern Graph Theory". What is interesting, is the relation to electrical networks, which may be worth considering in your problem. | |
| Feb 27, 2017 at 22:30 | comment | added | Joseph O'Rourke | This is close to what is known as the labeling problem. Here is a chapter by K.Kakoulis & I.Tollis that might help: PDF download. Most versions are NP-hard. | |
| Feb 27, 2017 at 22:20 | history | edited | Tom Solberg | CC BY-SA 3.0 |
added 50 characters in body
|
| Feb 27, 2017 at 22:19 | comment | added | Tom Solberg | Thanks @JosephO'Rourke, I'll clarify. Everything is axis-aligned, but the $k$ rectangles have given dimensions. | |
| Feb 27, 2017 at 22:17 | comment | added | Joseph O'Rourke | Why not place $k$ tiny squares in some little gap. The sum of the distances between those rectangles can be as small as desired. I must not understand the problem correctly... | |
| Feb 27, 2017 at 22:15 | comment | added | Joseph O'Rourke | Are your rectangle sides aligned with the surrounding unit square, or are they oriented arbitrarily? | |
| Feb 27, 2017 at 21:27 | history | asked | Tom Solberg | CC BY-SA 3.0 |