https://github.com/jujuadams/delaunay
Basic Delaunay triangulation, and pathfinding
https://github.com/jujuadams/delaunay
example gamemaker gms1
Last synced: 6 months ago
JSON representation
Basic Delaunay triangulation, and pathfinding
- Host: GitHub
- URL: https://github.com/jujuadams/delaunay
- Owner: JujuAdams
- License: mit
- Created: 2016-11-15T13:37:33.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2023-03-09T15:11:21.000Z (over 3 years ago)
- Last Synced: 2025-01-26T20:11:44.019Z (over 1 year ago)
- Topics: example, gamemaker, gms1
- Language: Game Maker Language
- Homepage:
- Size: 3.57 MB
- Stars: 9
- Watchers: 7
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Delaunay
### @jujuadams
Demonstrates the Delaunay triangle decomposition algorithm. This is not written in a particularly efficient way but should serve basic needs. Triangle decomposition is typically used to break down complex shapes into triangles ready for rendering (or collision detection). Delaunay's algorithm tries to ensure triangles are as non-thin as possible which is often useful for cleaner rendering and more reliable collision detection.
Additionally, a pathfinding example is included that breaks up a space into navigable nodes. The algo is Dijkstra: not the most efficient but good enough.