finding distance between curve intersections

Hey all,

I am quite new to grasshopper.

For a certain grid system I want to find the minimal distance between two points in U direction and the min distance between two points in V direction. Not the shortest distance but the length of the curve that goes through them. In the screenshot underneath I tried to visualize.

I tried to achieve this by using the CCX (curve intersection) component. The 'params A' output gives me the length from the origin to the intersection point. The manipulation of these numbers so that the minimum difference value is found is where I get stuck.

I want to use this system on more complex surfaces with double curvatures and variating grid distaces, so I would like it to be universal.

If anyone has got a suggestion on how to continue I would love to hear it.

Attachments:

vraag 14-5.gh, 10 KB

Replies to This Discussion

Permalink Reply by Laurent DELRIEU on May 14, 2017 at 3:28pm

Not enough time to finish, here is a beginning,

Attachments:

LD.gh, 12 KB

Permalink Reply by Daniel on May 15, 2017 at 4:23am

Hey, thanks for your reply.

To be honest I dont really think you understood my problem. I want the grid that I created on the surface to be there the way I defined it. The goal is to find what the shortest distance (over the surface) is between points. Because its a curved surface these distances may vary if I understand correctly

Greetings

Permalink Reply by Laurent DELRIEU on May 15, 2017 at 2:18pm

Something like this ? I distorded a surface to be able to look well at where is the min

Use of iso Curve, Shatter, CCX, flip matrix ... sort

Attachments: