Utility class to calculate a path in a given area and obstacles from a startpoint to a destination.
Report Bug
·
Request Feature
Table of Contents
For some time now, I have been pursuing the goal of programming an adventure game. An important part of such a game consists of clicking on a location on the scene whereupon the player moves along a path that is as short or as sensible as possible to the destination. This library is intended to provide this functionality.
TBD
TBD
- Define mainclass and entities
- calculate triangles of given area
- method to check if a given point is in the triangle
- calculate distance between two points
- calculate nearest point to a given line segment
- calculate nearest point to area
- Add obstacles
See the open issues for a full list of proposed features (and known issues).
Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature) - Commit your Changes (
git commit -m 'Add some AmazingFeature') - Push to the Branch (
git push origin feature/AmazingFeature) - Open a Pull Request
Distributed under the MIT License. See LICENSE for more information.
Dominik Sust - dominik.sust@[email protected]
Project Link: https://github.com/HarleyDavidson86/PathFinder
Thanks to David Gouveia and his blog entry about Pathfinding on a 2D Polygonal Map.