2000 · 23 citations · 7 references
ComputingComputer EngineeringComputer ScienceComputer NetworksInterconnection NetworksTopologyGraph AlgorithmsMesh NetworksMesh TopologyNetwork TopologyRoutingRouting Algorithms2D Mesh Topology3D Mesh TopologyHexagonal ArchitectureInterconnection GraphsInterconnection Network RoutingMultidimensional Mesh NetworksRouting In Mesh NetworksRouting Network Topology
The paper presents a convenient addressing scheme on 2D hexagonal meshes. It helps to derive simple and optimal routing and one-to-all broadcasting algorithms. We also show the existence of a Hamiltonian cycle that yields a ring embedding. We define 3D hexagonal graph as a generalization of the triangular plane tessellation, and consider it as a multiprocessor interconnection network. Some of its topological properties are studied. These properties are better than the well known multidimensional square mesh. A simple and optimal routing algorithm is also presented.
7
HARTS: a distributed real-time architecture
Kang G. Shin · Computer · 1991 · 108 citations
A digital geometry for hexagonal pixels
Sarah Bell, Fred Holroyd, David C. Mason · Image and Vision Computing · 1989 · 48 citations
Computer graphics on a hexagonal grid
Lewis N. Lester, John Sandor · Computers & Graphics · 1984 · 41 citations