An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points

Abstract

Highlights• A novel incremental convex hull algorithm is proposed with O (h 2 ) time complexity.• The convex hull is maintained as a set of line segments.• The proposed algorithm is faster than the existing algorithm when h < SQRT (n).