Home

Melbourne C++ Olympiad

Some intro goes here...

Some Topics / Challenges

Just some brainstorming for now...

2D Convex hull

Given a set of points, the convex hull is the minimal subset of points that fully encloses all of those points.

The challenge is, given a file that contains a list of 2D points, each on a separate line and in no particular order, find the convex hull of those points. The output does not need to be in any particular order.

Bonus points: order the points such that they form a line loop (i.e. the convex hull could be drawn P1 -> P2 -> P3 -> ... with no lines overlapping).