Drawing k-linear Metro Maps

04/05/2019

∙

by   Soeren Nickel, et al.

∙

0

∙

share

Schematic metro maps in practice as well as metro map layout algorithms usually adhere to an octilinear layout style with all paths composed of horizontal, vertical, and 45^∘-diagonal edges. Despite growing interest in non-octilinear metro maps, generic algorithms to draw metro maps based on a system of k > 2 equidistant slopes have not been investigated thoroughly. In this paper we present and implement an adaptation of the octilinear mixed-integer linear programming approach of Nöllenburg and Wolff (2011) that can draw k-linear metro maps.