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
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 21, 2015 at 15:40 | comment | added | Timothy Wofford |
@Alexei Boulbitch, The circles of radius mindist can overlap, but the center of each circle can only lie in one circle. Perhaps you meant to test with radius mindist/2?
|
|
| Aug 21, 2015 at 9:44 | comment | added | Alexei Boulbitch |
This Graphics[{Green, Point[pts], Red, Circle[#, mindist] & /@ scaledpts}, Frame -> True] reveals that there are some overlapping circles, though only few. Thus, not all resulting points are distant enough.
|
|
| Mar 5, 2012 at 19:22 | history | edited | Yves Klett | CC BY-SA 3.0 |
added 390 characters in body
|
| Mar 5, 2012 at 18:18 | history | edited | Yves Klett | CC BY-SA 3.0 |
added 63 characters in body
|
| Mar 5, 2012 at 18:13 | history | edited | Yves Klett | CC BY-SA 3.0 |
added 63 characters in body
|
| Mar 5, 2012 at 17:55 | history | edited | Yves Klett | CC BY-SA 3.0 |
added 1 characters in body
|
| Mar 5, 2012 at 17:47 | history | edited | Yves Klett | CC BY-SA 3.0 |
added 6 characters in body
|
| Mar 5, 2012 at 17:42 | history | answered | Yves Klett | CC BY-SA 3.0 |