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:
“Without metaphor the handling of general concepts such as culture and civilization becomes impossible, and that of disease and disorder is the obvious one for the case in point. Is not crisis itself a concept we owe to Hippocrates? In the social and cultural domain no metaphor is more apt than the pathological one.”
—Johan Huizinga (1872–1945)