A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

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

2021
*
Ceylon Journal of Science
*

RESEARCH ARTICLE 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). Abstract: The definition of the convex hull of a set of points is the smallest convex set containing all the points. Many algorithms have been proposed with the worst case time complexity is equal to O (n log n). It has been proved that the

doi:10.4038/cjs.v50i3.7907
fatcat:ixepocfthbethn3gofbtve4kfq