A Natural Way of Solving a Convex Hull Problem

Abstract

This article presents a new solution for the convex hull problem. The convex hull is a widely known problem in computational geometry. As nature is a rich source of ideas in the field of algorithms, the solution has been inspired by nature. A tight elastic band is modeled using agents and also nails as points of the problem. The convex hull problem will be solvable by simulating an elastic band with nails in a given environment. The algorithm runs in O(S) in which S is the area between the elastic band and convex hull polygon. This feature enables the algorithm to be computationally grown linearly as the number of points increases in a situation where there is a compact set of points. The algorithm is output-sensitive and can be implemented in a 2D and also a 3D space.