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:
“Oh, that I knew where I might find him, that I might come even to his dwelling! I would lay my case before him, and fill my mouth with arguments. I would learn what he would answer me, and understand what he would say to me. Would he contend with me in the greatness of his power? No; but he would give heed to me. There an upright person could reason with him, and I should be acquitted forever by my judge.”
—Bible: Hebrew, Job 23:3-7.
Job, of God.