Random Polygon Construction Algorithm

Recently, among the developing areas of computer science, one can distinguish geoinformatics and computational geometry. Using the methods and functions of the systems existing in these areas, it is possible to more effectively solve such problems as building a digital elevation model, performing spatial analysis on a plane, and solving regional search problems. Algorithms are applicable in various fields, including energy. In this paper, we propose an algorithm for constructing arbitrary polygons with a random arrangement of vertices. The construction method is based on the sequential addition of new vertices. The P
_new
point, a candidate for a new top, is randomly selected. If the set of requirements formulated in this paper is fulfilled for P
_new
then instead of a randomly selected existing edge E
_k
=[P
_k
,P
_k+1
] between the vertices P
_k
and
P
_k+
two new edges E
_new
¹
=[P
_k
,P
_new
] and E
_new
²
=[P
_new
,P
_k+1
] are added. The procedure is repeated until a given number of vertices is obtained. This algorithm allows to build random polygons of arbitrary configuration.