Timeline for What is the most ``diverse'' $k$-subset of $[0, 1]^m$?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 1, 2014 at 20:37 | vote | accept | user109711 | ||
| Jun 1, 2014 at 20:37 | |||||
| May 28, 2014 at 18:21 | comment | added | The Masked Avenger | Indeed. Once a good value for the radius is gotten, one can usually scale the box so that a scaled box packing yields the desired placement in the unscaled box. There may be an advantage in using the sphere union after trying a packing derived from a scaled box. | |
| May 28, 2014 at 18:15 | history | edited | The Masked Avenger | CC BY-SA 3.0 |
added 1 character in body
|
| May 28, 2014 at 18:13 | comment | added | Robert Israel | Note that you are not quite packing in the simplex because the spheres don't have to be contained in the simplex, just their centres. So it's packing in a somewhat larger region, the union of all spheres whose centres are in the simplex. | |
| May 28, 2014 at 16:20 | history | answered | The Masked Avenger | CC BY-SA 3.0 |