the branch?
i.e.
{0;0} {1;0} {2;0} {2;1} {3;0} {3;1} {3;2}
a a a c a c e
b b b d b d f
in order to get
{0} {1} {2} {3}
a a a + c a + c + e
b b b + d b + d + f
I have tried using GH_Path, treedata.Paths etc.
but have no idea how to perform a looping in the second dimension of a tree.
Any ideas?
Many Thanks!!…
I have a set of points (A) pulled by 3 other points (B,C,D). B,C, and D are only pulling the closest to themselves. Is there a way to find out how many points are pulled to B,C, and D individually?
sentation from the circle object
Dim n As New NurbsCurve(c.ToNurbsCurve())
'Divides the Curve domain in 3 segments (returns domain as double array)
Dim d() As Double = n.DivideByCount(3, True)
'to output the segment use trim function and the corresponding domain values...loop?
A = n.Trim(d(0), d(1))
End Sub
…
Added by Florian Frank at 5:10pm on February 4, 2011
4.
Here are the three conventions, I would stick with number 3:1. degrees, minutes and seconds (d m s)2. degrees, minutes and decimal minutes (d m.m)3. degrees, decimal degrees (d.d)
…
WORKSHOP A LIVING SYSTEM
DISCURSIVE WALL
Digital Weapons: Rhino + Grassshopper + Firefly + Digital Fabrication ( Cork)
Organization: VFabLab + Digitalab + EDPFablab
5 x 3 Meters.
For example.
If you have two lists of points.
List A List B
{0;0;0}(0) {0;0}(0)
{0;0;1}(0) {0;1}(0)
{0;2}(0)
{0;3}(0)
{0;4}(0)
And you want to merge the two lists so that the two points in list A are the end points.
Merge Lists Results:
{0;0}(0)
{0;0;0}(0)
{0;0;1}(0)
{0;1}(0)
{0;2}(0)
{0;3}(0)
{0;4}(0)
Because of their path structures the order is wrong from a simple merge so Flattening now is out of the question.
Path Mapper
{A;B} --> {A;B+1}
{A;B;C} --> {A;C*6}
---------------------
Results:
{0;0} --> {0;0+1} = {0;1}
{0;1} --> {0;1+1} = {0;2}
{0;2} --> {0;2+1} = {0;3}
{0;3} --> {0;3+1} = {0;4}
{0;4} --> {0;4+1} = {0;5}
{0;0;0} --> {0;0*6} = {0;0}
{0;0;1} --> {0;1*6} = {0;6}
Now with the Path Structures similar when they are re-ordered the results will have the two points of list A as the end points.
Question 2
why did the curve-line intersection lose the path structure? Both trees had 38 branches.
Both trees had 38 Paths but Tree A had more Items, 147 compared to 38 in Tree B.
So you get this happening:
{0;0;0;0;0;0}(0) compared to {0;0;0;0}(0) results: Null {0;0;0;0;0;0}(0)
Base result paths on longest
{0;0;1;0;0;0}(0) compared to {0;0;0;1}(0) results: Null {0;0;1;0;0;0}(0)
{0;0;2;0;0;0}(0) compared to {0;0;0;2}(0) results: Yes {0;0;2;0;0;0;0}(0)
Add a branch to contain result
{0;0;3;0;0;0}(0) compared to {0;0;0;3}(0) results: Yes {0;0;3;0;0;0;0}(0)
{0;0;3;0;0;0}(1) compared to {0;0;0;3}(0) results: No {0;0;3;0;0;0;1}(0)
{0;0;4;0;0;0}(0) compared to {0;0;0;4}(0) results: Yes {0;0;4;0;0;0;0}(0)
{0;0;4;0;0;0}(1) compared to {0;0;0;4}(0) results: Yes {0;0;4;0;0;0;1}(0)
{0;0;5;0;0;0}(0) compared to {0;0;0;5}(0) results: Yes {0;0;5;0;0;0;0}(0)
{0;0;5;0;0;0}(1) compared to {0;0;0;5}(0) results: Yes {0;0;5;0;0;0;1}(0)
{0;0;5;0;0;0}(2) compared to {0;0;0;5}(0) results: Yes {0;0;5;0;0;0;2}(0)
...... etc
…