I was trying to populate the a cube with branches of shortest path and 120 angle.I was able to achieve it with kangaroo and python.
However, I am stuck at the next step.
I have, lets say a sphere inside my cube where the points are being populated, some of the points being inside the sphere and some outside.
The python scripting right now is creating branches using nearest points inside the cube.
What if I need the syntax to eliminate the points inside the sphere, even if they are the nearest, and connect to the next nearest set of points outside the sphere but inside the cube.
I tried the brepinc component, But the lines are still getting inside the sphere even if there are no points.
The syntax should ignore point 2,even if it is shortest because it will enter the boundary of the sphere and instead connect to point 3 which is outside.
This will make you understand better-
How will that be possible.
Attaching the file herewith
Thank you for your time in advance