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 attention of those who frequent the camp-meetings at Eastham is said to be divided between the preaching of the Methodists and the preaching of the billows on the back side of the Cape, for they all stream over here in the course of their stay. I trust that in this case the loudest voice carries it. With what effect may we suppose the ocean to say, “My hearers!” to the multitude on the bank. On that side some John N. Maffit; on this, the Reverend Poluphloisboios Thalassa.”
—Henry David Thoreau (1817–1862)