Scholarlink

<p>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 <i>O</i>(<i>S</i>) in which <i>S</i> 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 2<i>D</i> and also a 3<i>D</i> space.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Natural Way of Solving a Convex Hull Problem

  • 期刊论文

  • 发表日期：

    2025年8月25日

查看全文
  • Sina Saadati,
  • Mohammadreza Razzazi

摘要

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.