Network Analysis:
Tsim Sha Tsui, Hong Kong.
The following digital twin is that of Hong Kong, specifically the southern tip of Kowloon, Tsim Sha Tsui. As one of the main city centers (with high employment density, a large tourism industry, and every form of public transportation in HK), it is interesting to see the “shortest path” between different points in a city that is dense with paths and possibilities.
The diagram above was generated using the Floyd-Warhsall and Dijkstra algorithms to measure spatial relations and the shortest path between two points respectively. Though having taken both length and angular weight coefficients into account, the path above shows a preference for a longer Euclidean, but simpler topological distance. The result is a longer path that only requires three left turns, favoring a more open and visible path along the harbor edge, as opposed to an angularly more efficient but visually obstructed path.
The diagram above was generated using the Floyd-Warhsall and Dijkstra algorithms to measure spatial relations and the shortest path between two points respectively. Though having taken both length and angular weight coefficients into account, the path above shows a preference for a longer Euclidean, but simpler topological distance. The result is a longer path that only requires three left turns, favoring a more open and visible path along the harbor edge, as opposed to an angularly more efficient but visually obstructed path.