Several Computational Geometry Algorithm Simulator
Serves:
- Find convex hull from a set of points, using O(N log N) divide and conquer algorithm.
- Find the convex hull's area, using O(N) triangle summing.
- Find the closest pair, using O(N log N) divide and conquer algorithm
- Find the voronoi diagram from a set of points, using O(N log N) Fortune's algorithm
How to run:
- Extract the package.
- Open terminal or command line.
- Go to the extracted folder, then type: "java TugasCG012"
How to use:
- Click on the field to place a point.
- To clear the field, click the "Clear" button.
- Use the check box to show convex hull, closest pair, and voronoi diagram
- To find the area of convex hull, click "Find Area" button.
Contributor:
- Felik Junvianto
- William Gozali