I am trying to split multi curves, which are in separate branches, with their points of intersection and then cull them if they are outside of certain closed lines. If I use graft then my data is no longer separated.
Can you suggest any way to sort my initial geometry? Lets say I have a bunch of curves as initial geometry. They can be either in 3D or 2D. What I need is a way to sort the geometry in polygons. They can be 3,4,5,6, etc. sided.
Also, I’ve just noticed. The perpendicular lines do not cross each other in the solution you gave me. I need to split all the lines, so I have the little squares also.
I need to keep the tree structure. The big problem is how to take all of the branches, intersect the curves and keep the tree structure. It proves very difficult task. But I need to keep the tree structure because later I will project some of the geometry onto coresponding planes and if I don’t keep the tree structure there is no way of doing this.
Now there are missing lines. Why is this so crazy difficult? I am trying a bunch of options in parallel to you.
Also now the different pranches intersect with each other and some bellong to the wrong group at the end.
If you open the last def I have uploaded, I almost have what I need. But just almoust. For some reason there are some extra points here and there and I can’t find a way to get rid of them.
Yes. If you exqamine the individual branches you will see that there are some extra points.
Open the definition I have uploaded. The only problem with it is that there are some extra points that I don’t know how to remove. Baybe it will be easier to fix this.