shortestPath

Using galapagos + Dijkstra algorythm (Giulio Piacentino shortest path) to find place where all incoming guests will have more-less the same (and short) path to walk.

5 members like this

View Full Size

Tags: dijkstra, galapagos

Comment

You need to be a member of Grasshopper to add comments!

Join Grasshopper

Comment by Gongming Liu on April 7, 2012 at 6:21pm: that's really nice! will be a amazing architecture diagram

Comment by Mateusz Zwierzycki on April 2, 2012 at 10:55am: There is nothing complicated here :

1. Basic curves/paths are manually drawn

2. I use Giulio's Piacentino shortest path script, and galapagos to evaluate destination point on map (xyz point)

3. Resulting polylines are moved up with move component(obviously)

4. Polylines are then piped, and coloured with preview component(use HSL material as preview with H values from 0 to 1 to obtain nice, basic colours)

Thats all !

Comment by Isak Bergwall on March 28, 2012 at 5:31am: This looks awesome! If you would like to share it I would also be interested!!

isak@aftermath.se

Thank you!

(I'm a guy so I won't kiss you like bea :P )