This is a tool to visualize the Graham Scan algorithm for finding the convex hull of random points.
Click here to download the .jar to test it out!
- select which shape to generate points in
- random shape generation
- change the amount of dots
- change the delay and step size to control the speed of the algorithm
- toggle the visibility of both the dots and the lines showing the hull
- a "loop" option to continue generating and finding the hull of new shapes
- RANDOM: a random shape with 3-100 vertices
- HEART: a uniform heart shape
- SQUARE: a uniform square
- CIRCLE: a uniform circle
- TRIANGLE: a triangle whose top point position varies
If you change the dot amount to 100_000 the shapes become mostly filled in.