PFALGOVIZ

In grid-based algorithm, the search space was divided into tiles or rectangles. In case of navigation mesh, we have convex polygons. The agent can enter or exit this polygon at any angle. This means that contrary to discrete search space in case grids or graphs, we have a continuous search space. The image shows visualisation of Polyanya whcih is state-of-the-art algorithm for path finding problems on a navigation mesh. The implementation can be again found in WARTHOG.