Dijkstra Pathfinding with Python
Posted 25 March 2012 - 04:55 PM
senior FX TD - Rhythm & Hues
Posted 26 March 2012 - 11:52 PM
Thank you in advanced.
Posted 27 March 2012 - 05:09 AM
The 3D grid is invisible in the image, but I've photoshoped in some dark red markers to give you a sense of depth in the image.
cooking times get rather long very fast however and the more complex it gets the higher the chances are one or more lines aren't generated correctly. I'm not sure if this is related to the algorithm or due to the foreach nodes.
I am getting a lot of "breaking while loop" warnings however.
The 3D grid i'm using has roughly 10.000 points with roughly 8-12 connections each.
vi_rus, would it be ok if I try to implement your HDK version?
And if it is, do you have an example file that I can try to implement?
Thank you in advance. Though I'd understand if you refuse.
Edited by hyperforce, 27 March 2012 - 07:07 AM.
Posted 27 March 2012 - 08:51 AM
most libraries provide numerous shortest path algorithms that should be pretty fast for around 10000 points.
Edited by petz, 27 March 2012 - 01:19 PM.
Posted 19 April 2012 - 12:21 AM
I'm using it to build the corridors and where they cross smaller rooms as you can see below:
0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users