18 Oct
2020
18 Oct
'20
2:39 p.m.
=Keith F. Lynch Envision the roads having, not zero width, but infinitesimal width.
It sounds fascinating, but I'm really having trouble picturing this. Are the grid points at the intersections of these narrow-most roads? Are the jays walking "diagonally" along them or across them or what? You imply the shortest path from 0,0 to 2,2 goes thru 1,1. But why? Given some arbitrary path from A to B, how do we compute its length? Can you help by providing some worked examples or the like? Thanks!