a specific domain, for example:
0.) 0 to 1 -----> 11 random values from 0 to 1 (0.245,0.678,0.36,0.78,.28,0.18........)
1.) 1 to 2 -----> 11 random values from 1 to 2 (1.26,1.36,1.01,1.68,1.26,1.96.........)
3.) 2 to 3 -----> 11 random values from 2 to 3 (2.96,2.45,2.78,2.56,2.98,2.10..........)
4.) 3 to 4 and so on where I have a data set containing 11 paths with 11 values and the values fall within the specific domain.
Like my post above I have the correct path but I need to feed it the correct seed to get different values for each number. I tried grafting a series similar to the last post but it scrambles my data. Thanks so much for the help!
…
13 5 15 6 17 7 ... …
But it seems I have not been clear:
the input values (3,5,7,9,11,13) should be presented in the way of "number slider" parameter. So by increasing the value of the slider from minimum 3, to 5, 7, 9, 13, 15, 17... I should get an output numbers of 0,1,3,4,5,6,7...
So I if choose value 3 on the input "number slider", on the other end, I want 0 as an output.
Or if I choose value 5 on the input "number slider", I want 1 as an output, and so on.
Is this possible?…
ee 3)
{5}
0 15
{6}
0 16
And I want to place points at every possible combination of these coordinates, treating Tree 1 as X coordinates, Tree 2 as Y coordinates, and Tree 3 as Z coordinates. Also, I would like the list of points to be a tree with paths corresponding to the coordinates. Wouldn't it be nice if I could plug these trees into a Point XYZ, with a new "branch cross reference" method, and get the following result?
{0:3:5}
0 {10.0, 13.0, 15.0}
{0:3:6}
0 {10.0, 13.0, 16.0}
{0:4:5}
0 {10.0, 14.0, 15.0}
{0:4:6}
0 {10.0, 14.0, 16.0}
{1:3:5}
0 {11.0, 13.0, 15.0}
{1:3:6}
0 {11.0, 13.0, 16.0}
{1:4:5}
0 {11.0, 14.0, 15.0}
{1:4:6}
0 {11.0, 14.0, 16.0}
{2:3:5}
0 {12.0, 13.0, 15.0}
{2:3:6}
0 {12.0, 13.0, 16.0}
{2:4:5}
0 {12.0, 14.0, 15.0}
{2:4:6}
0 {12.0, 14.0, 16.0}
In this form of cross referencing, every combination of individual branches from the different lists is used as separate input, and the output for each combination is put onto a branch in the result whose path is the concatenation of the input branch paths used.…
Added by Andy Edwards at 7:03pm on November 3, 2009
segments (ie. polylines)
2 = conic section (ie. arcs, circles, ellipses, parabolas, hyperbolas)
3 = standard freeform curve
5 = smoother freeform curve
The higher the degree, the less effect a single control-point has on the curve, but the further that weak effect reaches. Degree=5 curves are smoother, but it's also harder to add local details to it without adding a lot of control points. Rhino supports curves up to degree=11, but you almost never need more than 5.…
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!…
in the desired order.
0 = 0
1 = 1
2 = 6
3 = 7
4 = 8
5 = 9
6 = 12
7 = 13
8 = 2
9 = 3
10 = 4
11 = 5
12 = 10
13 = 11
Where the first number is the index and the second number is the actual sorting key. Then you sort these keys while sorting your curves in parallel using the A input of the Sort component.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…