Geodesic
Routing on lattice-cellular structures
Numerical methods and programming, Tome 5 (2004) no. 1, pp. 107-117

Voir la notice de l'article provenant de la source Math-Net.Ru

An extension of the class of lattice graphs is considered. In order to become close to the Euclidean metric, inclusion of additional ribs with weights equal to the corresponding lengths of vectors in the Euclidean space is performed in a neighborhood on the lattice. A correspondence between the coordinates of nodes incident to the additional ribs and sequences of irreducible Farey-Cauchy fractions is established. An algorithm for constructing a set of the shortest paths on such a lattice is proposed. In essence, this algorithm models the wave process of constructing the field of all shortest paths from a set-source. Some estimates and examples are given to illustrate the computer realization of the algorithm proposed.
Keywords: lattice graphs, neighborhood on lattice, integer points, shortest paths, metrics, wave process. 
@article{VMP_2004_5_1_a9,
     author = {G. G. Ryabov},
     title = {Routing on lattice-cellular structures},
     journal = {Numerical methods and programming},
     pages = {107--117},
     publisher = {mathdoc},
     volume = {5},
     number = {1},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2004_5_1_a9/}
}
TY  - JOUR
AU  - G. G. Ryabov
TI  - Routing on lattice-cellular structures
JO  - Numerical methods and programming
PY  - 2004
SP  - 107
EP  - 117
VL  - 5
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMP_2004_5_1_a9/
LA  - ru
ID  - VMP_2004_5_1_a9
ER  - 
%0 Journal Article
%A G. G. Ryabov
%T Routing on lattice-cellular structures
%J Numerical methods and programming
%D 2004
%P 107-117
%V 5
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMP_2004_5_1_a9/
%G ru
%F VMP_2004_5_1_a9
G. G. Ryabov. Routing on lattice-cellular structures. Numerical methods and programming, Tome 5 (2004) no. 1, pp. 107-117. http://geodesic.mathdoc.fr/item/VMP_2004_5_1_a9/