Farthest Point on Curve

Replies to This Discussion

Permalink Reply by Matthijs la Roi on October 17, 2011 at 1:26am

Maybe just divide the curve with a lot of points. Then do a distance check of all the points with your orgin point and use the sort component to get the farthest one.

Permalink Reply by Norm Sash on February 5, 2014 at 7:37am

Is the solution that Matthijs suggested (divide the curve into a bunch of points and then do a distance check between all of the points) still the best method to finding the farthest (or furthest?) point on a curve?  Is there another solution?

Permalink Reply by David Rutten on February 5, 2014 at 10:01am

Probably. I'm sure there's smart ways of doing it, but that'll require all sorts of loops and recursions.

I tried creating an inverted curve (by mirroring control-points in a sphere), but it only works on NurbsCurves and only when they have lots of control-points, and even then it sometimes gets confused when the point is very near the curve.

--

David Rutten

david@mcneel.com

Attachments:

• invertcurve.gh, 10 KB

Permalink Reply by Yoann Mescam (Systemiq) on February 5, 2014 at 12:13pm

Dividing the curve in N subcurves, then taking the subcurve which is the "farthest" one (by using middle point). Repeat until the length is under a tolerance.

Not perfect but should work.

Attached an example working with Anemone:

Attachments:

• CurveFarthest.gh, 13 KB

Permalink Reply by Piotr on February 5, 2014 at 3:08pm

Another way of doing this. A bit primitive and slow, but does not involve scripting and is using very few components. Hoopsnake can be replaced with other loopers.

Works best when start points is on a curve.