Computing Data-driven Multilinear Metro Maps.

Traditionally, most schematic metro maps in practice as well as metro map layout algorithms adhere to an <italic>octolinear</italic> layout style with all paths composed of horizontal, vertical, and $45^\circ$45∘-diagonal edges. Despite growing interest in more general <italic>multilinear</italic> metro maps, generic algorithms to draw metro maps based on a system of $k \ge 2$k≥2 not necessarily equidistant slopes have not been investigated thoroughly. In this paper, we present and implement an adaptation of the octolinear mixed-integer linear programming approach of Nöllenburg and Wolff (2011) that can draw metro maps schematized to any set ${\cal C}$C of arbitrary orientations. We further present a data-driven approach to determine a suitable set ${\cal C}$C by either detecting the best rotation of an equidistant orientation system or by clustering the input edge orientations using a <italic>k</italic>-medians algorithm. We demonstrate the new possibilities of our method using several real-world examples. [ABSTRACT FROM AUTHOR]