nts me this:
[[0], [0, 1], [0, 1, 2], [0, 1, 2, 3], [0, 1, 2, 3, 4], [0, 1, 2, 3, 4, 5], [0, 1, 2, 3, 4, 5, 6], [0, 1, 2, 3, 4, 5, 6, 7]]
this is what I wanted but how to convert this to tree in grasshopper?
In grasshopper I just get:
8x IronPython.Runtime.List…
ards to the number before the start number...
i.e. 9, 0, 1, 2, 3, 4, 5, 6, 7, 8
then it will need to repeat this pattern (continuing to count upwards) and the repeat number is based on a slider (for example 3 in the case illustrated below):
9, 0, 1, 2, 3, 4, 5, 6, 7, 8
19, 10, 11, 12, 13, 14, 15, 16, 17, 18,
29, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
if anyone has any ideas on how to create this series it would be great
M.…
dont get you, i am saying sleect numbers in range 1 to 10, starting from 1 with a step of 2.
1 to 10 by 3 = 1 4 7 10
1 to 10 by 5 = 1 6
1 to 10 by 1 = 1 to 10 = 1 2 3 4 5 6 7 8 9 10
Added by Steve Lewis at 3:15pm on November 11, 2013
hi all,
i'm using the trial 90 days rhino 5. i want to install gh version 51 but it defaultly install for rhino 4. so any way to fix this problem ?
thanks for reading,
blak
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
0, 5, 10, 15, 20
1, 6, 11, 16, 21
2, 7, 12, 17, 22
3, 8, 13, 18, 23
4, 9, 14, 19, 24
and if i'm here is because i'm not able... :)
can you help me?
thank you
…