Algorithm for constructing a concave hull of a set of points

This article discusses a new algorithm for constructing a concave hull for a set of points on a plane, in which a minimal convex hull is first constructed, and then the list of its points is sequentially expanded by adding new points forming depressions. In the proposed algorithm, the selection of new points of the original set for the addition of depressions is carried out on the basis of a set of original conditions. Changing the detail coefficient allows you to set the depth of the depressions and, accordingly, the degree of detail of the concave hull. The results obtained during the software implementation of the algorithm are presented.