{1;1;4}{1;1;5}{1;2;0}{1;2;1}{1;2;2}{1;2;3}{1;2;4}{1;2;5}{1;3;0}{1;3;1}{1;3;2}{1;3;3}{1;3;4}{1;3;5}
etc...
and I want to format as a text it so it replaces the innermost branch with a letter so {0;0;1} would read A-0-1. I am able to replace all the symbols using replace text but am no sure if there's a way to convert a number to a letter.…
Added by Ryan Whitby at 12:40pm on February 3, 2015
Is it like this:
If a beam is connected from nod 0 to 1 and from 1 to 4. Another from 2 to 3 and from 3 to 5.
Node 1 and 3 have the same coordinates, but are they rigidly connected or not?
ep is to understan the logics of what you want to do, in your case, build 4 point surfaces (u also need to know the right direction to build the surfaces). Then you can write an hipotetic list (by hand in a paper) of what you want. In your case the list was (0, 1, 3, 2) (2, 3, 5, 4) (4, 5, 7, 6), etc... if you can imagine building 2 lists, each one with the sequences (0, 2, 4, 6, etcc) and (1, 3, 5, 7, etc..) then you can manage with shift and graft to finally have four lists. A( 0 1 2 3 ...) B (1 3 5 etc..) C(3 5 7 etc..) D (2 4 6 etc..). And to achieve the 2 first lists, you need to get the odd and the pair numbers. The cull pattern does that amazingy well. With a pattern True-False you get de pair numbers, and with the False-True pattern you get de odd numbers.
Hope it was clear enough…
Added by Pep Tornabell at 5:32am on November 19, 2009
branches in each A's list of B's, or remove its ends etcso that if I want to remove the last B in every A{0;1},{0;2},{0;3},{0;4},{0;5},{0;6}{1;1},{1;2},{1;3},{1;4}{2;1},{2;2},{2;3},{2;4},{2;5}would become{0;1},{0;2},{0;3},{0;4},{0;5}
{1;1},{1;2},{1;3}
{2;1},{2;2},{2;3},{2;4}I guess the question is do I need to figure out the cull pattern- each B may have different lengths...…