Thanks for the tips. I have Lunchbox and lot of others plugin but I don’t use them much nor take enough time to discover them.
For the K-Means used for tree I needed a library in order to make a tool inside a C# component. I shall look if Lunchbox use an accessible library. It seems they use Accord.
I have been trying to follow this topic but i am stuck at a problem.
I am able to get all the curves and the pipes correct but after this FAIL to Boolean Union the Surface or Brep. Does anyone know how to solve this?
I added some new tools in Nautilus plugin (in validation process the 26th of February 2023)
Let first begin with a network of curves. It could be lines, polylines or curves. Curve could be closed but it will not work on all scenarios. Curves must not be duplicate.
You will see that the outputs are polylines or lines that begins/ends at intersection with other branches. This component could be useful to make a clean network of curves that could be then smoothed but keeping the connections.
Then plug these curves int the component TreeFromNetworkOfCurves