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 often used to think myself in the case of the fox-hunter, who, when he had toiled and sweated all day in the chase as if some unheard-of blessing was to crown his success, finds at last all he has got by his labor is a stinking nauseous animal. But my condition was yet worse than his; for he leaves the loathsome wretch to be torn by his hounds, whilst I was obliged to fondle mine, and meanly pretend him to be the object of my love.”
—Sarah Fielding (1710–1768)