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:
“There are a great many of these accusers, and they have been accusing me now for a great many years, and what is more, they approached you at the most impressionable age, when some of you were children or adolescents; and literally won their case by default, because there was no one to defend me.”
—Socrates (469–399 B.C.)