inds 3 points closer than the threshold and 3 furhter
3. It forms 3 groups containing 3 points each + 3 separate groups containing 1 point each
Is that correct?
Also, how to extract one of the group? I wanted to use Tree Item and write number of the group in index but I don't know what "path" is for.
Thanks in advance for answer,
PS: Can I ask anyone for a very simple example in gh of how this component works and showing how to extract one of the groups?…
r example:
{1} {6} Is this possible to do with Replace Branches?
{2} {5}
{3} => {3}
{4} {4}
{5} {5}
{6} {6}
If it were two lists, then it's very easy with List Replace, but kill me, I can't get what's the logic in Replace Branches...
Please help!
…
Added by Artyom Maxim at 10:05am on January 29, 2013
53 → 53 → 63 → 74 → 74 → 84 → 9
As you can see from the above list the connection sequence comes in waves of three, where each group of similar indices on the left is associated with a group of three incrementing indices on the right.
Some combination of Series components will probably generate this list, but it'll only work for the first ring, the second one will need a different connection pattern. It is perhaps better to just encode the integer pairs by hand. But then you cannot change your mind about the number of sides later.…
Added by David Rutten at 10:39am on October 21, 2015
ork out from the path Structure which the sections are by the branch address.
If your planes start on the left then you would have seen
{0} (N = 3) <-- these are your first 3 planes missing the bar
{0;3} (N = 1)
{0;4} (N = 1)
{0;5} (N = 1)
{0;6} (N = 1)
Like I said there is a bug which will be resolved when GH 0.9+ will be released and each plane will have its own branch regardless of a Null value or not…
a follow up question... how do I wrap a list onto itself at a certain frequency?
i.e. I want the list {1;2;3;4;5;6;7;8;9}
to become {1,4,7; 2,6,8; 3,6,9} wrapped every 3rd item
Added by Joshua Jordan at 5:30pm on November 17, 2012
l at each point intersection, less 14. align holes to common angle between each 2 points of intersection (so ovals align with curve)5. copy 4. 360/60 about center circle (creates 6 curves rotated thru 360)6. it appears there a 3 more sets of curves that need to be taken care in the same way as 1 thru 4 (see colander pic)6. project the oval patterns onto, 1/2 a sphere somewhat larger that the surface circle, to avoid extreme oval distortion.7. needs some Boolean subtraction of holes from sphere surface
Does this simple road map have some merit?
…
ng its top is 5/6 so I guess there is a pattern developing here.
Cube missing 1 face (6-1)/6 = 5/6
Cube missing 2 faces (6-2)/6 = 4/6 (2/3)
Cube missing 3 faces (6-3)/6 = 3/6 (1/2)
cube missing 4 faces (6-4)/6 = 2/6 (1/3)
…
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!…