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:
“A new talker will often call her caregiver “mommy,” which makes parents worry that the child is confused about who is who. She isn’t. This is a case of limited vocabulary rather than mixed-up identities. When a child has only one word for the female person who takes care of her, calling both of them “mommy” is understandable.”
—Amy Laura Dombro (20th century)