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:
“As one knows the poet by his fine music, so one can recognise the liar by his rich rhythmic utterance, and in neither case will the casual inspiration of the moment suffice. Here, as elsewhere, practice must precede perfection.”
—Oscar Wilde (1854–1900)