shortest path between A and B controlling number of connections?

Replies to This Discussion

Permalink Reply by peter fotiadis on April 14, 2017 at 8:54am

Give the attached a spin (but is carried over via code)

Attachments:

• ClosestToSegmentPoint_V2.gh, 126 KB

Permalink Reply by Pag_ on April 14, 2017 at 2:24pm

Thanks a million for your response. I will test it out now.

Permalink Reply by peter fotiadis on April 15, 2017 at 12:49am

BTW: In your oversimplified sequel ... sorting is easy but in real-life is not that simple (thus I've included 3 ways although the sort along curve requires some curve auto-extend feature in order to work properly [if is possible at all, that is]). 

Permalink Reply by Mohamed Naeim on April 15, 2017 at 2:34pm

I tried something with Grasshopper(no code)

But I am not sure if its right or even what you looking for 

and this 

Permalink Reply by Mohamed Naeim on April 15, 2017 at 2:47pm

file attached

Attachments:

• SHORTEST PATH 02.gh, 22 KB