CM6: Closest Node Pairing Algorithm for Generating Cable Networks

Comment

Comment by ARYA AISHWARYA on February 9, 2019 at 8:09am

Hello Anders,

I have been trying to do the closest node pairing algorithm, but since I am new to Python I could'nt achieve any result.I tried doing it on grasshopper using anemone, I will share the file with you.

I am trying to achieve the minimal path algorithm of Steiners tree in Python using the minimal path algorithm.
The syntax would be as follows
First I need to create a cube of any dimension.

Then I need to specify one origin say point A and destination point say B.

Now for this point A,B I need to create a machine based network which will automatically enroute A to B.

Where the angle will be constant i.e 120, length can be a variable, triangular node(steiners tree)using these constraints it will create a network.

Now, I should iterate the program in such a way that I should specify the further points say like A1 and B1 so on.
The program will contain a limit constraint where it will come out of iteration loop and start a new loop,forming the network.

By this I will get a dense network of 120 deg branches.

The branching gets denser the moment I add source and destination points.

There can be 100 iterations to reach from A to B but the algorithm chooses the one following the minimal path.

I would be highly thankful to you if you would please share the python syntax and grasshopper definitionCapture.JPG for the same

Thank you for your time in advance

I would be highly grateful if you help me through

warm regards

Arya

12.gifShortest%20path%20algorithm.gh

min-paths.jpgcc.henn.studyimagesminimalpaths.jpg 

Comment by Sridhar Baldava on May 31, 2016 at 6:08am

Reminded me of this http://murderandcreate.com/physics/random_arboretum/index.html