# raywenderlich/swift-algorithm-club

Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
..
Failed to load latest commit information.
Convex Hull.xcodeproj
Convex Hull
Tests

# Convex Hull

Given a group of points on a plane. The Convex Hull algorithm calculates the shape (made up from the points itself) containing all these points. It can also be used on a collection of points of different dimensions. This implementation however covers points on a plane. It essentially calculates the lines between points which together contain all points. In comparing different solutions to this problem we can describe each algorithm in terms of it's big-O time complexity.

There are multiple Convex Hull algorithms but this solution is called Quickhull, is comes from the work of both W. Eddy in 1977 and also separately A. Bykat in 1978, this algorithm has an expected time complexity of O(n log n), but it's worst-case time-complexity can be O(n^2) . With average conditions the algorithm has ok efficiency, but it's time-complexity can start to become more exponential in cases of high symmetry or where there are points lying on the circumference of a circle for example.

## Quickhull

The quickhull algorithm works as follows:

• The algorithm takes an input of a collection of points. These points should be ordered on their x-coordinate value.
• We first find the two points A and B with the minimum(A) and the maximum(B) x-coordinates (as these will obviously be part of the hull).
• Use the line formed by the two points to divide the set in two subsets of points, which will be processed recursively.
• Determine the point, on one side of the line, with the maximum distance from the line. The two points found before along with this one form a triangle.
• The points lying inside of that triangle cannot be part of the convex hull and can therefore be ignored in the next steps.
• Repeat the previous two steps on the two lines formed by the triangle (not the initial line).
• Keep on doing so on until no more points are left, the recursion has come to an end and the points selected constitute the convex hull.

Our function will have the following defininition:

`findHull(points: [CGPoint], p1: CGPoint, p2: CGPoint)`

``````findHull(S1, A, B)
findHull(S2, B, A)
``````

What this function does is the following:

1. If `points` is empty we return as there are no points to the right of our line to add to our hull.
2. Draw a line from `p1` to `p2`.
3. Find the point in `points` that is furthest away from this line. (`maxPoint`)
4. Add `maxPoint` to the hull right after `p1`.
5. Draw a line (`line1`) from `p1` to `maxPoint`.
6. Draw a line (`line2`) from `maxPoint` to `p2`. (These lines now form a triangle)
7. All points within this triangle are of course not part of the hull and thus can be ignored. We check which points in `points` are to the right of `line1` these are grouped in an array `s1`.
8. All points that are to the right of `line2` are grouped in an array `s2`. Note that there are no points that are both to the right of `line1` and `line2` as then `maxPoint` wouldn't be the point furthest away from our initial line between `p1` and `p2`.
9. We call `findHull(_, _, _)` again on our new groups of points to find more hull points.
``````findHull(s1, p1, maxPoint)
findHull(s2, maxPoint, p2)
``````

This eventually leaves us with an array of points describing the convex hull.