面向数据驱动的多线地铁地图
Towards Data-Driven Multilinear Metro Maps
摘要:
传统上,实践中的大多数示意性地铁地图以及地铁地图布局算法坚持八线性布局风格,其中所有路径由水平、垂直和45°对角线边缘组成。尽管越来越多的兴趣在更一般的多线地铁地图,通用算法绘制地铁地图的基础上,系统的$k \ge 2$不一定等距的斜坡还没有被彻底调查。在本文中,我们提出并实现了Nöllenburg和Wolff(2011)的八线性混合整数线性规划方法的适应,可以绘制任何方向的任意集合C的地铁地图。我们进一步提出了一种数据驱动的方法来确定一个合适的集合C,通过检测等距方向系统的最佳旋转或通过使用k均值算法聚类输入边缘方向。我们展示了我们的方法使用几个现实世界的例子的新的可能性。
英文摘要:
Traditionally, most schematic metro maps in practice 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 \ge 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 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 using several real-world examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。