rray of cables, fasteners and other useless stuff.
PS: one issue brings the other :
There's some components that respect the tree and others that do whatever they want.
For instance imagine 23 line sets that belong to 3 branches (the facade profiles). If you apply Divide curv (say with 7 divisions) you expect to get back 23*7 points in 3 branches....not the case I'm afraid.
However if you apply Eval Curv with just one value for t > you get 23 points in 3 branches.
Moral: more red Russian vodka required (+ a decent cigar)
…
ant to find all paths where exactly two items are the same like in branch {1}. How can I solve this in VB? Is there an easy "search in list" class or do I have to iterate over all items by myself ??
Regards Alex…
{4}-0;3
{5}-6;7
{6}-5;7
{7}-5;6
Here it can be shown that there are two subgraphs containing 0,1,2,3,4 and 5,6,7. How can I use spiderweb (either using scripting or the components) to give me this result when I have many more vertices??
Thanks,
Sam…
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