Timeline for Generating random, non-repeating points on the plane
Current License: CC BY-SA 4.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 17, 2019 at 14:21 | history | edited | MikeY | CC BY-SA 4.0 |
added 319 characters in body
|
May 17, 2019 at 14:00 | comment | added | MikeY |
One interesting tidbit is with the data structured as I did, you actually can't have all of the data on a single plane if you have an even number of points. With an odd number of points, the sum of values for each point must add to 3(n+1)/2 where n is the number of points.
|
|
May 17, 2019 at 13:57 | comment | added | MikeY |
@Roman, I remember that post on Ordering@Ordering .
|
|
May 17, 2019 at 13:55 | comment | added | CA Trevillian | Great expansion! Same goes for your answer, can you expand on your one-liner’s through process/methodology? :D @Roman thank you for the link, what a great combo of question and answer! | |
May 17, 2019 at 13:40 | comment | added | Roman |
You may be interested in this performance comparison for Ordering[Ordering[list]] .
|
|
May 17, 2019 at 13:38 | comment | added | Roman |
or Transpose@Table[RandomSample@Range@numPts, {dim}] to generate random permutations directly
|
|
May 17, 2019 at 13:26 | history | edited | MikeY | CC BY-SA 4.0 |
added 156 characters in body
|
May 17, 2019 at 12:54 | history | answered | MikeY | CC BY-SA 4.0 |