g definition but in diva for grasshopper in material it just appear dusty_med and not metal_railings and metal_treads. How I should write the correct definition?
void brightfunc dusty_med4 dirt dirt.cal -s 101 .25
dusty_med metal metal_railings005 .7 .7 .7 .3 .2
dusty_med metal metal_treads005 .5 .5 .5 .3 .2…
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
e
7. True
8. True <-- this one
9. True
10. False
11. True
12. False
13. True
14. True <-- this one
15. True
16. False
17. True
18. False
19. True
20. True <-- this one
21. True
22. False
23. True
24. False
25. True
26. True <-- this one
27. True
28. False
29. True
30. False
31. True
32. True <-- this one
33. True
Any idea how I can solve this?
Thanks!…
erations, is not it?
This is what I finally want and how I plan to do it:
In the starting tree, points are listed accordingly to the (11) 4-side-panels they belong to. I need to do a tree where each of the 11 lists contains not the points composing the panels but the points code of the points composing the panels. the point code is the number in the flattened list that refers to the points (like, panel 1 is made of points n 0,1,4,18, and so on). To do this, I suppose that I will use my tree of 11 lists of 33 true-false values, and apply it to cull 11 times a series of numbers from 0 to 32. I ll post it if it works!…
{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…