A program to generate a set of convex hulls from a list of arbitrary polygons, then find a path around them. Convex hulls are found in a divide-and-conquer manner and are bruteforced using Andrew’s montone chain convex hull algorithm. Paths are found using rudimentary raycasting.
| Key | Function |
|---|---|
| Left mouse | Add point to current polygon |
| Right mouse | Confirm current polygon |
| Q | Place waypoint |
| E | Find path between waypoints |
