Timeline for Efficient way to generate random points with a predefined lower bound on their pairwise Euclidean distance
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2014 at 20:04 | comment | added | dr.blochwave | In answer to my own question that was similar to this problem, there's a 3D version of this solution at mathematica.stackexchange.com/questions/48427/… | |
| Feb 15, 2013 at 5:09 | comment | added | Gerardo Marset | @AndyRoss I'm sorry, can't. I don't have Mathematica. | |
| Feb 15, 2013 at 4:13 | comment | added | Andy Ross | @GerardoMarset that's a good suggestion. Give it a try. If the timings are better feel free to edit. | |
| Feb 14, 2013 at 23:52 | comment | added | Gerardo Marset | Improvement: instead of calculating a square root for each point, calculate the square of the distance. (Also you could iterate over the points and break at the first one that is found to be too close, instead of calculating all their distances and checking the minimum, but I'm not sure if that'd be faster). | |
| Mar 19, 2012 at 11:10 | vote | accept | PlatoManiac | ||
| Mar 6, 2012 at 3:19 | history | edited | Andy Ross | CC BY-SA 3.0 |
added 1002 characters in body
|
| Mar 5, 2012 at 20:07 | history | edited | Andy Ross | CC BY-SA 3.0 |
added 135 characters in body
|
| Mar 5, 2012 at 19:43 | comment | added | Andy Ross | @Yves That would be yet more fun.. at least when animated we see this to some extent based on their relative laziness :) | |
| Mar 5, 2012 at 19:38 | comment | added | Yves Klett | You should color the points according to their degree of happiness (or claustrophobia)! | |
| Mar 5, 2012 at 19:32 | history | answered | Andy Ross | CC BY-SA 3.0 |