Natural Way of Solving a Convex Hull Problem
Sina Saadati, Mohammadreza Razzazi

TL;DR
This paper introduces a nature-inspired algorithm for the convex hull problem, modeling an elastic band with agents and nails, which efficiently finds the hull by simulating physical elastic behavior.
Contribution
The paper presents a novel, biologically inspired approach to solving the convex hull problem using elastic band simulation, differing from traditional geometric algorithms.
Findings
Algorithm runs in linear time relative to fixation time
Effective in modeling convex hulls through physical simulation
Offers an intuitive, nature-inspired alternative to classical methods
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Modular Robots and Swarm Intelligence
