Pathfinding

Am implementation of pathfinding where the goal is to find the shortest path possible between two points on a navmesh.

First, the AStar algorithm is used to calculate which triangles of the navmesh need to be traversed to go from the start to the goal. Then, the "stupid simple" funneling algorithm is used to determine which vertices need to be traversed, and which can be skipped.



Contact me at: ludvig.thread249@passmail.net