Gift Wrapping Algorithm - Planar Case

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:

    Wealth is not without its advantages and the case to the contrary, although it has often been made, has never proved widely persuasive.
    John Kenneth Galbraith (b. 1908)