Hi,
I have a tree {A;B}, where B is always a list of points. My goal is to make a line between the points with the largest distance between them (for each B seperately). Therefore, I need to compare the distance between all the points within each B. Although it doesn’t seems difficult, I don’t find the correct method. Can anyone help me?
thank you,
unnamed.gh (9.8 KB)
I added it.
So the main goal is to make a line model from a group of meshes. In my case, the meshes will always be beam-shaped, retrieved from a 3D architectural model and I want to make lines from this beams, so I can use this for my structural analysis software. The problem is sometimes those beams have holes in them, which makes it more difiifcult to create the propr line.
Thanks for looking at it!