Computational Geometry 006: Convex Hull


Convex Hulls

Build a Convex Hull

Build a convex hull of the given n points, i.e. build a convex polygon with a minimum perimeter that contains all the points.

draw extras for debugging