An Algorithm for Finding a Convex Hull of the Vertices of a Polygonal Line

An algorithm is presented for computing a convex hull of the vertices of a simple polygonal line. The basic idea is to compute in some phases. In each phase, the first line L 1 is computed under four different cases. Then some vertices on L 1 are arranged into an incremental sequence of the angles of the vertices in a specific way where line L 2 is constructed. Finally, L 2 is checked retrogressively and the vertices of non-convex hulls removed. The remaining points are the vertices of a convex hull. This algorithm is not only easy to realize, but also of linear time complexity.