Convex Hull S = {(xi, yi)|i = 1, 2,...,n} assume no two have same x coordinate, no two have same y coordinate, and no three in a line for convenience Convex Hull ( CH(S) ) == smallest convex polygon containing all points in S Brute force Test each line segment to see if it makes up an edge of the convex hull • If the rest of the points are on one side of the segment, the segment is on the convex..