Branch from one point

Hi all,

I'm trying to get multiple branches from one point like the example.

Any ideas?

Attachments:

cq_dla (1).jpg, 218 KB
branch from point.gh, 4 KB

Replies to This Discussion

Permalink Reply by peter fotiadis on January 25, 2016 at 7:26am

Add Z to your graph pts according some logic (distance from pStart for instance + some "damping" + some values remap policy + ...) and then re-do the graph based on the point to point connectivity data available via the prox component.

This attached (Load Rhino file first) does this but it's solely via code ... thus it can serve to you only as a "proof" that the above work.

Attachments:

Graph_to_pTop_Connectivity_23A.3dm, 96 KB
Graph_to_pTop_Connectivity_23A.gh, 124 KB

Permalink Reply by James on February 1, 2016 at 4:41pm

Hi,

thank you for that.

However I wanted to try and master this in the 2D format also. I tried the point connectivity and also the shortest walk plug in but have had no joy in figuring it out. So if there was a node, the point, surrounded by other points, I would to have that node branching off to outer points in the least amount of lines to create the shortest system. like in the attached image.

thanks,

Attachments:

minimal-path-network_sm (1).jpg, 236 KB

Permalink Reply by peter fotiadis on February 1, 2016 at 11:16pm

You mean shortest routes a la Dijkstra? (or using the newer and faster routing algos for BIG node numbers). Like this?

I.e. given an adjacency Matrix (cost of "going" from a connected A to a connected B) find all the shortest routes from all the nodes to a given "current" node - or from some A to that node. Classic Dijkstra stuff, in other words. (obviously works in 3d as well).