Planar Case
In the two-dimensional case the algorithm is also known as Jarvis's march, after R. A. Jarvis, who published it in 1973; it has O(nh) time complexity, where n is the number of points and h is the number of points on the convex hull. Its real-life performance compared with other convex hull algorithms is favorable when n is small or h is expected to be very small with respect to n. In general cases the algorithm is outperformed by many others.
Read more about this topic: Gift Wrapping Algorithm
Famous quotes containing the word case:
“Half the testimony in the Bobbitt case sounded like Sally Jesse Raphael. Juries watch programs like this and are ready to listen.”
—William Geimer, U.S. law educator. New York Times, p. B18 (January 28, 1994)