Timeline for Most dispersed set of points in a disk?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2014 at 12:51 | answer | added | Manfred Weis | timeline score: 0 | |
| Dec 14, 2014 at 8:22 | comment | added | Manfred Weis | @François Willot can you give some indication of the task you have to solve? Because of the huge number of points I guess it is a practical problem; so maybe an approximate solution would be acceptable. What would be your preferences regarding quality of the lower bound and fast execution of the heuristics? | |
| Dec 13, 2014 at 11:54 | answer | added | Manfred Weis | timeline score: 0 | |
| Dec 11, 2014 at 11:38 | comment | added | Gerry Myerson | @S.Carnahan, done. | |
| Dec 11, 2014 at 11:38 | answer | added | Gerry Myerson | timeline score: 9 | |
| Dec 11, 2014 at 11:06 | comment | added | S. Carnahan♦ | @GerryMyerson You might as well turn your comment into an answer, since we are unlikely to see anything better in the near future. | |
| Dec 11, 2014 at 0:45 | comment | added | Gerry Myerson | Actually, I think this is the "Heillbron triangle problem", see en.wikipedia.org/wiki/Heilbronn_triangle_problem | |
| Dec 11, 2014 at 0:44 | comment | added | Joseph O'Rourke | Not an answer, but you want a point set that maximizes dispersion or minimizes discrepancy, but defined in terms of $\triangle$ area rather than distance. It is known that the maximum number of $\triangle$s of minimum area is $\Theta(n^2)$, for $n$ points. | |
| Dec 11, 2014 at 0:43 | comment | added | Gerry Myerson | This sounds something like the problem of packing $n$ identical circles into a circle. So far as I know, the optimal solution for that problem is not even known for $n=12$, so a billion may be a bit much to ask for. | |
| Dec 10, 2014 at 23:48 | review | First posts | |||
| Dec 10, 2014 at 23:50 | |||||
| Dec 10, 2014 at 23:46 | history | asked | François Willot | CC BY-SA 3.0 |