Timeline for Distributing fire stations in a circular city
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 12, 2017 at 0:50 | history | suggested | jeq | CC BY-SA 3.0 |
Copied image to imgur.com, as it was not being displayed because of the new https rule. Added link to original image source.
|
| Nov 12, 2017 at 0:04 | review | Suggested edits | |||
| S Nov 12, 2017 at 0:50 | |||||
| Mar 1, 2013 at 4:19 | comment | added | Leo Arruda | I understand it, but could you provide a proof or refer to a place where I can find it? | |
| Feb 27, 2013 at 17:50 | comment | added | Ben Barber | Minimising the distance to the nearest centre is equivalent to covering by smallest disks of equal radius. | |
| Feb 25, 2013 at 15:55 | comment | added | Leo Arruda | Thanks a lot Joseph, this seems to be a good solution but I'm not convinced same radius circles are always the best solution, do you think this can be/has been shown? | |
| Feb 25, 2013 at 1:13 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 284 characters in body
|
| Feb 24, 2013 at 23:28 | comment | added | Yoav Kallus | More from Wikipedia: en.wikipedia.org/wiki/Disk_covering_problem | |
| Feb 24, 2013 at 20:53 | history | answered | Abhinav Kumar | CC BY-SA 3.0 |