Triangulated Polygon A-star is a pathfinder which is able to determine the shortest path between one starting point and multiple target points in a triangulated polygon with polygon holes.
The image shows the result of a pathfinding between one starting point and three target points. The shade of the triangles indicate the number of times the given triangle was expanded. In this case white means zero, grey means one expansion.
This repository contains the implementation of the algorithm in C#.
The build contains a demo application, which can be used for testing it in various arrangements.
The project is licensed under
- István Engedy, my thesis advisor, whose support was key in the development of this project
- Douglas Demyen, whose master's thesis guided me this direction
- The creators of the Funnel algorithm on which this solution is based
- Richard Potter, whose library Vector3 was used extensively during development
- Ákos Pfeff for his remarks during refactoring