Line Crossing Minimization on Metro Maps
Publication Date
January 2007
Document Type
Contribution to a Book
Publication Title
Graph Drawing
Editor
Seok-Hee Hong, Takao Nishizeki, Wu Quan
Volume
4875
DOI
10.1007/978-3-540-77537-9_24
First Page
231
Last Page
242
Abstract
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V,E), so that the total number of crossings among pairs of paths is minimized. This problem arises when drawing metro maps, where the embedding of G depicts the structure of the underlying network, the nodes of G correspond to train stations, an edge connecting two nodes implies that there exists a railway line which connects them, whereas the paths illustrate the lines connecting terminal stations. We call this the metro-line crossing minimization problem (MLCM).In contrast to the problem of drawing the underlying graph nicely, MLCM has received fewer attention. It was recently introduced by Benkert et. al in [4] . In this paper, as a first step towards solving MLCM in arbitrary graphs, we study path and tree networks. We examine several variations of the problem for which we develop algorithms for obtaining optimal solutions.
Keywords
Metro Maps, Crossing Minimization, Lines, Paths, Trees
Recommended Citation
Michael Bekos, Michael Kaufmann, Katerina Potika, and Antonios Symvonis. "Line Crossing Minimization on Metro Maps" Graph Drawing (2007): 231-242. https://doi.org/10.1007/978-3-540-77537-9_24
Comments
SJSU users: Use the following link to login and access this article via SJSU databases.