The convex hull of a planar point set is the smallest convex polygon enclosing the entire set. Computing the convex hull is a fundamental operation with uses in several different fields of research. In this thesis, we explore several different traditional and modern algorithms for computing the convex hull in two dimensional Euclidean space. The algorithms are then evaluated through several different practical performance tests. Algorithm Ordered hull is described in greater detail, as it proved to be significantly faster than Quickhull, which is commonly regarded as the fastest algorithm for the problem.
|
