Natural Way of Solving a Convex Hull Problem
Sina Saadati, Mohammadreza Razzazi
Abstract
Open-access reader
Sina Saadati, Mohammadreza Razzazi
Abstract
Open-access reader
In this article, a new solution for the convex hull problem has been presented. 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. By simulating an elastic band with nails in an environment, solving the convex hull problem will be possible. The algorithm runs in O(t) in which t is the time that an elastic band will get fixed.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this article, a new solution for the convex hull problem has been presented. 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. By simulating an elastic band with nails in an environment, solving the convex hull problem will be possible. The algorithm runs in O(t) in which t is the time that an elastic band will get fixed.
Key concepts: Convex hull, Hull, Regular polygon, Mathematics, Mathematical optimization, Output-sensitive algorithm, Computer science, Convex set