Bounding the Approximation Error of Shortest Paths in Weighted Square and Hexagonal Meshes

The ratio of the length of the shortest grid path to the length of the actual shortest path in a weighted square or hexagonal mesh is bounded above by a constant factor, independent of the weight assignment.