Jarvis convex hull in the plane

This is a variant on Jarvis march that deletes points found to be inside the convex hull so far. The extra test for containment means the improvement is not significant. Remains O(nh) worst case time.
( Graham & Yao's algorithm is faster, and easy if you have a sort routine.)

• Detail toggles the vertex numbers and some of the edge weights.
• Animate toggles some animation of partial computation
• Update is the button you push when the input is ready; If comparing times, click twice because the first time may include loading or swapping time.
• Random generates 50 random points
• Clear All and Delete Last give minimalist editing.

Code by Jack Snoeyink, University of British Columbia Back to Jack's Computational Geometry Demo page.