Marching squares-based approach to finding the convex hull of a planar set of points

Many applications required the use of the convex hull of a finite set of geometric entities in the plane. Finding the convex hull has been a key problem in computational geometry. Although a considerable number of algorithms have been proposed since the 1960s, there are still issues associated with the effectiveness and implementation. This paper presents a practical approach applying the marching squares algorithms to the Jarvis' march for a planar set of points. The points can be obtained from practical situations, for example digitised scanned images.