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:
“True and false are attributes of speech not of things. And where speech is not, there is neither truth nor falsehood. Error there may be, as when we expect that which shall not be; or suspect what has not been: but in neither case can a man be charged with untruth.”
—Thomas Hobbes (1588–1679)