RUS  ENG
Full version
JOURNALS // News of the Kabardino-Balkarian Scientific Center of the Russian Academy of Sciences // Archive

News of the Kabardin-Balkar scientific center of RAS, 2002 Issue 1, Pages 128–133 (Mi izkab826)

MATHEMATICS

On the algorithm for identifying the “middle line” in a discrete set on a plane

I. S. Shraifel', L. I. Sin

South-Russian State University of Economics and Service, Shakhty

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

UDC: 681.518



© Steklov Math. Inst. of RAS, 2024