Realtime linear cartograms and metro maps
Thomas C. van Dijk, Dieter Lutz · 2018
We introduce an efficient algorithm for drawing spatially-informative linear cartograms: transforming a geometric network such that given edge lengths are realised, while distorting edge directions as little as possible. Our algorithm is based on carefully linearised least squares optimisation, forgoing the need for an iterative solver. This is fast and ensures a well-defined result. The classic application of linear cartograms is drawing travel-time maps; we also discuss drawing schematised metro maps.