Approximation of the set of points by
polygonal curve of shortest length
Authors: M. Mirhamidov
Annotation: In this article the approximation of temporal series by polygonal curve of shortest length is
considered. The temporal series are interpreted by the set of points of plane, and approximation of the set
of points by the polygonal curve leads to search of the shortest way between two segments. The
polynomial algorithm that solves the assigned task by building the visibility graph and using Dijkstra’s
algorithm is realized.
Keywords: approximation of points of plane, visibility graph, plane with polygonal obstacles, shortest
path, Dijkstra’s algorithm