Traditionally, most schematic metro maps as well as metro map layout algorithms adhere to an octolinear layout style with all paths composed of horizontal, vertical, and 45∘-diagonal edges. Despite growing interest in more general multilinear metro maps, generic algorithms to draw metro maps based on a system of k≥ 2 not necessarily equidistant slopes have not been investigated thoroughly. 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 C of arbitrary orientations. We further present a data-driven approach to determine a suitable set C by either detecting the best rotation of an equidistant orientation system or by clustering the input edge orientations using a k-means algorithm. We demonstrate the new possibilities of our method in a real-world case study.
CITATION STYLE
Nickel, S., & Nöllenburg, M. (2020). Towards Data-Driven Multilinear Metro Maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12169 LNAI, pp. 153–161). Springer. https://doi.org/10.1007/978-3-030-54249-8_12
Mendeley helps you to discover research relevant for your work.