A new linear convex hull algorithm for simple polygons (Corresp.)

A new optimal algorithm for computing the convex hull of a simple polygon in the plane, along with a proof of correctness, is presented. The main novelty of the proposed algorithm is its use of existing concepts such as the unimodality of the area of a triangle inscribed in a convex polygon and Sldansky´s scan. The combination of these concepts gives us new insight into the problem.