Abstract:
The work assumes an algorithm for constructing the “middle line” of a finite set of integer points in $R^2$. The effectiveness of the algorithm is theoretically proven in all cases where this space is in principle feasible. This algorithm can be used for pattern recognition and processing of graphic information.
Keywords:algorithm, Jordan $t$-path, $t$-connected set