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:
“A woman’s whole life is a history of the affections. The heart is her world: it is there her ambition strives for empire; it is there her avarice seeks for hidden treasures. She sends forth her sympathies on adventure; she embarks her whole soul on the traffic of affection; and if shipwrecked, her case is hopeless—for it is a bankruptcy of the heart.”
—Washington Irving (1783–1859)