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:
“I do not allow myself to be moved by anything except the law. If there has been a mistake in the law, or if I think there has been perjury or injustice, I will weigh the petition most carefully, but I do not permit myself to be moved by more harrowing details, and I try to treat each case as if I was reviewing it or hearing it for the first time from the bench.”
—William Howard Taft (1857–1930)