Modeless Convex Hull Algorithm for Simple Polygons

摘要

This document presents an orner n algorithm which computes the convex hull of a two-dimensional non-self-intersecting polygon. The algorithm recovers much of the simplicity of the one presented by Sklansky and subsequently disproved. Unlike several algorithms which have been found since then, the modified algorithm executes a truly uniform (modeless) traversal of all the vertices of the polygon. This makes it possible to extend the algorithm to extract geometric information about the interior of the polygon. (Author).