4 more posts in this thread. [Missing image file: Untitled.png]
I'm trying to split a graph into groups, where each group is made up of all the nodes which are connected by a straight line.
The point of this is that once it's done, pathfinding becomes just following a series of straight lines, with unconnected regions automatically being ignored.
Preferably, I want a method that can be used dynamically, adding and removing nodes as fast a possible.
pic is sort of an example of what I mean, dark grey are walls, each color is a group, groups can overlap.
2 more posts in this thread. [Missing image file: 1353644491125.jpg]
this is why I am addicted to 4chan, why are you:
>the internet gives you new information
>your brain releases dopamine when you get new information
>you wire yourself to use the internet when you want dopamine
>the more salient the information, the more dopamine
>4chan provides shocking extreme dangerous exciting content through porn, fetish discussion violence, racism and raiding
>this is why I am addicted to 4chan, why are you?