Application of sorting algorithms for convex hull determination

Abstract

The proposed research explores the possibilities of applying some base algorithms for sorting to the process of finding a convex in order to optimize the time indicators of this process. A comparative analysis of the time characteristics has been performed using different time approaches in Graham’s algorithm. The empirical results obtained have been used as a basis for building a pattern model of the process of finding a convex hull. It performs point sorting by a given criterion and finds a convex hull on a two-dimensional set of points. For this model, a visualization module has been developed that can be used as a learning environment in the courses of computing and complexity of algorithms.

Keywords

• algorithms for sorting
• convex hull
• Graham’s algorithm