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:
“In the case of a deliberate, palpable, and dangerous exercise of ... powers not granted by the compact, the States ... are in duty bound to interpose for arresting the progress of the evil, and for maintaining within their respective limits the authorities, rights, and liberties appertaining to them.”
—James Madison (1751–1836)