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.)
Code by Jack Snoeyink, University of British Columbia Back to Jack's Computational Geometry Demo page.