Timeline for Efficiently filling area with disks located at certain points
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 11, 2016 at 19:17 | history | edited | Michael E2 |
edited tags
|
|
| Jan 10, 2014 at 10:16 | history | edited | Mr.Wizard |
edited tags
|
|
| Apr 8, 2013 at 13:49 | vote | accept | einbandi | ||
| Apr 8, 2013 at 2:02 | answer | added | Michael E2 | timeline score: 16 | |
| Apr 8, 2013 at 1:35 | comment | added | wxffles |
Using FindMaximum instead of NArgMax seems lots quicker and gives a similar result. Setting the starting radius to halfway to the closest point makes it even quicker.
|
|
| Apr 8, 2013 at 0:22 | comment | added | rm -rf♦ | @einbandi It's been a while since I played with Daniel's code there, but I believe you can just set the penalty for moving the center to infinity | |
| Apr 8, 2013 at 0:02 | comment | added | einbandi | @rm -rf wouldn't that relocate the disks to form a more tightly packed area? I'd like the disks' positions to be fixed at the starting points, if possible. | |
| Apr 7, 2013 at 23:43 | comment | added | Jens | Another cool related question is How can I pack circles of different sizes into a spiral? | |
| Apr 7, 2013 at 23:26 | comment | added | rm -rf♦ |
You can use Daniel's answer here and simply replace the overlap function he uses with an appropriate one for circles (e.g. r1 + r2 > EuclideanDistance[c1, c2])
|
|
| Apr 7, 2013 at 22:55 | history | tweeted | twitter.com/#!/StackMma/status/321033475014676481 | ||
| Apr 7, 2013 at 22:54 | comment | added | Dr. belisarius | sweetpepperspray.blogspot.com.ar/2010/06/osmos.html | |
| Apr 7, 2013 at 22:43 | history | asked | einbandi | CC BY-SA 3.0 |