Skip to main content
Conference ProceedingsOPEN ACCESS

Minimal routing in the triangular grid and in a family of related Tori

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1300 LNCS 218-225
DOI: 10.1007/bfb0002736
10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A "minimal routing" scheme is presented that yields a shortest path between any source and destination node in a triangular (or "hexava-lent") grid. The simplicity of the protocol results from a preliminary statement of a hexagonal coordinate system that perfectly fits the symmetries of the grid. A shortest path routing is first stated for the infinite grid and normalized afterwards for a family of Cayley graphs - namely the arrowhead and the diamond - organized as tori.

Cite

CITATION STYLE

APA

Désérable, D. (1997). Minimal routing in the triangular grid and in a family of related Tori. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 218–225). Springer Verlag. https://doi.org/10.1007/bfb0002736

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free