1. Consider the 2-D problem of points {p**1**...p**n**} on the xy-axis. Let min be the index of the point with minimal x-value (if more than 1, pick the one with maximal y-value). Similarly, let max be the index of the point with maximal y-value of the set of points with maximal x-value.

2. Let T be the set of all points with x-values greater than x(p**min**) and less than x(p**max**), union with p**min** and p**max**.

3. Call __CONNECT(min,max,T)__, which returns the sequence of indices of the points in the upper convex hull.

4. In a similar fashion, construct the lower convex hull.

5. Join upper and lower hulls together.