n of unique possible sets in sequences(ABC = CBA), with order ignored.
this why it was possible to extract combinations from permutations without iterations, by only eliminating similar characters with matching characters.
That brings the question, whether it's possible to generate the combinations (56) without generating the whole possible (336) permutations, which already took around 8000 iterations
…
Added by Mohamed Naeim at 9:01pm on November 3, 2016
t edge then the following method gets you 6 points distributed around the ellipse starting at that point. It uses an intersection line to split the ellipse to get a new start for each half then combines the points back into one branch.
It's been set up to receive multiple sets of 3 points but the pathmapper will probably need to be altered depending on the structure.
David will undoubted-ably show you a much more straight forward method. :)
…
Added by Danny Boyes at 2:46pm on February 11, 2011