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 more problematic example is the parallel between the increasingly abstract and insubstantial picture of the physical universe which modern physics has given us and the popularity of abstract and non-representational forms of art and poetry. In each case the representation of reality is increasingly removed from the picture which is immediately presented to us by our senses.”
—Harvey Brooks (b. 1915)