Convex Graph

This work was carried out during the discipline of the Optimization Techniques course of the Digital Games program in Unisinos by students Jean Luca and Leonardo Santana. The project contemplates the generation of a convex polygon through points determined by the user or by a random generator. After the generation of the finished convex hull, the user can create a Voronoi diagram of this set of points, then create a graph and finally, choose two points and activate the A * algorithm to trace a possible shortest path between the points.

Interaction:

Click on the black screen to add points.

Use the buttons on the right of the screen to run the algorithms.

After pressing the Graph button, click in one of the nodes to define it as a start and click in another to define it as a goal.

To deselect a node as a start or goal click in it again, after that another node can be selected as it.

After selecting a Start and Goal nodes, you can run the A* by pressing its button. You can also re run it after selecting another nodes with the same button.