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:
“The doctors are all agreed that I am suffering for want of society. Was never a case like it. First, I did not know that I was suffering at all. Secondly, as an Irishman might say, I had thought it was indigestion of the society I got.”
—Henry David Thoreau (1817–1862)