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 is not a more disgusting spectacle under the sun than our subserviency to British criticism. It is disgusting, first, because it is truckling, servile, pusillanimous—secondly, because of its gross irrationality. We know the British to bear us little but ill will—we know that, in no case do they utter unbiased opinions of American books ... we know all this, and yet, day after day, submit our necks to the degrading yoke of the crudest opinion that emanates from the fatherland.”
—Edgar Allan Poe (1809–1845)