An Efficient Improved Algorithm of Convex Hull

Abstract

This paper introduced points and directed line segment relation judgment method, the characteristics of generation and Graham method using the original convex hull generation algorithm of convex hull discrete points of the convex hull, an improved algorithm for planar discrete point set is proposed. The main idea is to use quadrilateral to divide planar discrete point set into five blocks, and then by judgment in addition to the four district quadrilateral internally within the point is in a convex edge. The result shows that the method is relatively simple program, high computational efficiency.

An efficient method for modeling and evaluating the bench terrain of open-pit mines

“…This study proposes an improved algorithm that can automatically extract the optimal boundary of an arbitrary point distribution based on the convex hull model algorithm (Qian and Liu, 2007;Liu et al, 2011;Yang, 2021). In the improved algorithm, the α-shape algorithm which automatically adjusts the 2α value is used to extract the boundary in the twodimensional mesh.…”