Geodesic
On the algorithm for identifying the “middle line” in a discrete set on a plane
News of the Kabardin-Balkar scientific center of RAS, no. 1 (2002), pp. 128-133 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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 
@article{IZKAB_2002_1_a19,
     author = {I. S. Shraifel' and L. I. Sin},
     title = {On the algorithm for identifying the {\textquotedblleft}middle line{\textquotedblright} in a discrete set on a plane},
     journal = {News of the Kabardin-Balkar scientific center of RAS},
     pages = {128--133},
     year = {2002},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IZKAB_2002_1_a19/}
}
TY  - JOUR
AU  - I. S. Shraifel'
AU  - L. I. Sin
TI  - On the algorithm for identifying the “middle line” in a discrete set on a plane
JO  - News of the Kabardin-Balkar scientific center of RAS
PY  - 2002
SP  - 128
EP  - 133
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/IZKAB_2002_1_a19/
LA  - ru
ID  - IZKAB_2002_1_a19
ER  - 
%0 Journal Article
%A I. S. Shraifel'
%A L. I. Sin
%T On the algorithm for identifying the “middle line” in a discrete set on a plane
%J News of the Kabardin-Balkar scientific center of RAS
%D 2002
%P 128-133
%N 1
%U http://geodesic.mathdoc.fr/item/IZKAB_2002_1_a19/
%G ru
%F IZKAB_2002_1_a19
I. S. Shraifel'; L. I. Sin. On the algorithm for identifying the “middle line” in a discrete set on a plane. News of the Kabardin-Balkar scientific center of RAS, no. 1 (2002), pp. 128-133. http://geodesic.mathdoc.fr/item/IZKAB_2002_1_a19/