Given a set of n points (Xi , Yi ) in the Euclidian plane , a Convex hull is the smallest convex polygon which contains all the given points. A shortest path around is one of the convex hull ...