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
…
Start Rhino, run _Grasshopper.
Officially the edit-and-continue feature allows you to rebuild the code while it's running, but I have never been able to make it work.…
Added by David Rutten at 2:14am on February 24, 2016
se the cull pattern, so I wanted to make the pattern using a function component. x=y. x= the original list and y= the interval i wanted to remove. So the pattern should be:
0: false
1:false
2:false
3:false
4:true
5:true
6:true
7:true
8:false
9:false
10:false
etc...…
Added by Rasmus Holst at 3:32am on November 17, 2009
ells and offset it and then split it.
1) extrude the origional surface
2)make a 3D voronoi around it
3) find the intersecting surfaces of the two geometries
4)hide the rest
5) offset the surfaces to give some thickness to the material
6)split the polysurface with the origional voronoi
Or
4) use weaverbird window (I think it's called, the green square with a hole in it)
5)split the polysurface with the origional voronoi…
Added by Jack Young at 1:00am on November 29, 2016
and says "repeat every Nth element", meaning say if N was 3, I would get A B C C D E F F G H. I would also like to be able to then insert a list of 3 elements in between each of the repeats. For example, I wanted to insert: 1. 1
2. 2
3. 3 into the list, I would get A B C 1 2 3 C D E F 1 2 3 F G H. It seems like an easy task, but I cannot for the life of me figure out how to do it, I must be making a very basic mistake. I am new to grasshopper, so any and all help I could get would be GREATLY appreciated!…
rve
10 curve
11 curve
12 curve
13 curve
...and I'd like to rearrange the order in which the curve are listed, to something like this:
{0,0,0}
0 curve
1 curve
8 curve
9 curve
10 curve
11 curve
2 curve
3 curve
4 curve
5 curve
12 curve
13 curve
6 curve
7 curve
I hope this makes sense.
Thank in advance for any advice,
John…
of the intersection points is giving me some problem.
Here is the process i've done to come up with the grid (best viewing the image!):
1. create a base rectangular polygon;
2. find the diagonals and subdivide these, let's say in 10 points;
3. connect the points of one diagonal to the adjacent one in this order:
1 to 9
2 to 8
3 to 7
4 to 6
5 to 5
6 to 4
7 to 3
8 to 2
9 to 1
4. find the intersection points on every line drawn.
Now I would like to create individual surfaces connecting all the points that form the vertices of the polygons, but I cannot find out how...
Can somebody help me?
Thanks so much!…
0;3} - 2 curves
{1;1} - 2 curves
{1;2} - 2 curves
{1;3} - 2 curves
{1;1} - 2 curves
{2;2} - 2 curves
{2;3}- 2 curves
And what I want.
{0} - 6 curves
{1} - 8 curves
{2} - 4 curves
I have tried some different stuff whit the path mapper tool, but I am not to skilled in using it. I imagine it can do the work for me?.
If anyone can help me out, I would be glad.
…