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 circumstances with which every thing in this world is begirt, give every thing in this world its size and shape;—and by tightening it, or relaxing it, this way or that, make the thing to be, what it is—great—little—good—bad—indifferent or not indifferent, just as the case happens.”
—Laurence Sterne (1713–1768)