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:
“Of all my prosecutors ... not one is my peer, but each and all are my political sovereigns; and had your honor submitted my case to the jury, as was clearly your duty, then I should have had just cause of protest, for not one of those men was my peer; but, native or foreign born, white or black, rich or poor, educated or ignorant, sober or drunk, each and every man of them was my political superior; hence, in no sense, my peer.”
—Susan B. Anthony (1820–1906)