Convex Hull

1.The convex hull Q is the set of all convex combinations of points in the given set Q.

2.Given a set of points in the plane, the convex hull of the set is the smallest convex polygon that contains all the points of it.

Applications

• Collision Avoidance - Especailly for " Robotics"
• Visual Pattern Recognition
• Image Processing
• Geographical Information Systems (GIS) - Computing Accessibility Maps
• Shape Analysis- for Deficency Trees
• Replacement of Bounding Boxes