Skip to main content

Indie game storeFree gamesFun gamesHorror games
Game developmentAssetsComics
SalesBundles
Jobs
TagsGame Engines
(+1)

Haha yea the crystal this time around seems to be a bit rude haha.

for the node creation/connection generation logic, I used Binary space partitioning first to place random nodes without having g them overlap with good margin between.

And then used delaunay's triangulation to calculate neighboring connections.

After found minimum spanning tree to, create the smallest number edges to connect all the nodes.

Finally, added some of the unused lines back to the map to create cycles.

I actually had created dungeon generation plugin for one of my tutorial videos which you can see here!

oh cool. you're a legit youtube dude!


Yeah being aware of all these specific and tricky algorithms, and then applying them to gamedev comes with wisdom.  I need to start a some kind of cheat-sheet collection  archive. 

I'll definitely add  Binary space partitioning, delaunay's triangulation, and minimum spanning tree to that list. 

haha yea! these small things here and there start to come together and before you know it you have awesome library of things to use!
Good luck and happy dev'ing