Shortest-paths preserving metro maps

T.Y. Milea; O.J. Schrijvers; K. Buchin; H.J. Haverkort

doi:10.1007/978-3-642-25878-7_45

Shortest-paths preserving metro maps

T.Y. Milea
, O.J. Schrijvers
, K. Buchin
, H.J. Haverkort

Algorithms

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

5 Citations (Scopus)

Abstract

A metro map, or subway map, is a schematic representation of a metro system of a city. The main goal of a metro map is to provide a traveler with information on which lines to take to get from station A to station B, and at which stations he needs to switch lines. It is often not beneficial to use the geographical embedding of the system, but rather a representation where the relevant information is presented as clearly as possible. There are several algorithms that aim to generate such maps [2].

Original language	English
Title of host publication	Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers)
Editors	M.J. Kreveld, van, B. Speckmann
Place of Publication	Berlin
Publisher	Springer
Pages	445-446
ISBN (Print)	978-3-642-25877-0
DOIs	https://doi.org/10.1007/978-3-642-25878-7_45
Publication status	Published - 2012

Publication series

Name	Lecture Notes in Computer Science
Volume	7034
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-642-25878-7_45

Cite this

Milea, T. Y., Schrijvers, O. J., Buchin, K., & Haverkort, H. J. (2012). Shortest-paths preserving metro maps. In M. J. Kreveld, van, & B. Speckmann (Eds.), Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers) (pp. 445-446). (Lecture Notes in Computer Science; Vol. 7034). Springer. https://doi.org/10.1007/978-3-642-25878-7_45

@inproceedings{40035a1914d549c88be5c769aff937a3,

title = "Shortest-paths preserving metro maps",

abstract = "A metro map, or subway map, is a schematic representation of a metro system of a city. The main goal of a metro map is to provide a traveler with information on which lines to take to get from station A to station B, and at which stations he needs to switch lines. It is often not beneficial to use the geographical embedding of the system, but rather a representation where the relevant information is presented as clearly as possible. There are several algorithms that aim to generate such maps [2].",

author = "T.Y. Milea and O.J. Schrijvers and K. Buchin and H.J. Haverkort",

year = "2012",

doi = "10.1007/978-3-642-25878-7\_45",

language = "English",

isbn = "978-3-642-25877-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "445--446",

editor = "\{Kreveld, van\}, M.J. and B. Speckmann",

booktitle = "Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers)",

address = "Germany",

}

Milea, TY, Schrijvers, OJ, Buchin, K & Haverkort, HJ 2012, Shortest-paths preserving metro maps. in MJ Kreveld, van & B Speckmann (eds), Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers). Lecture Notes in Computer Science, vol. 7034, Springer, Berlin, pp. 445-446. https://doi.org/10.1007/978-3-642-25878-7_45

Shortest-paths preserving metro maps. / Milea, T.Y.; Schrijvers, O.J.; Buchin, K. et al.
Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers). ed. / M.J. Kreveld, van; B. Speckmann. Berlin: Springer, 2012. p. 445-446 (Lecture Notes in Computer Science; Vol. 7034).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Shortest-paths preserving metro maps

AU - Milea, T.Y.

AU - Schrijvers, O.J.

AU - Buchin, K.

AU - Haverkort, H.J.

PY - 2012

Y1 - 2012

N2 - A metro map, or subway map, is a schematic representation of a metro system of a city. The main goal of a metro map is to provide a traveler with information on which lines to take to get from station A to station B, and at which stations he needs to switch lines. It is often not beneficial to use the geographical embedding of the system, but rather a representation where the relevant information is presented as clearly as possible. There are several algorithms that aim to generate such maps [2].

AB - A metro map, or subway map, is a schematic representation of a metro system of a city. The main goal of a metro map is to provide a traveler with information on which lines to take to get from station A to station B, and at which stations he needs to switch lines. It is often not beneficial to use the geographical embedding of the system, but rather a representation where the relevant information is presented as clearly as possible. There are several algorithms that aim to generate such maps [2].

U2 - 10.1007/978-3-642-25878-7_45

DO - 10.1007/978-3-642-25878-7_45

M3 - Conference contribution

SN - 978-3-642-25877-0

T3 - Lecture Notes in Computer Science

SP - 445

EP - 446

BT - Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers)

A2 - Kreveld, van, M.J.

A2 - Speckmann, B.

PB - Springer

CY - Berlin

ER -

Shortest-paths preserving metro maps

Abstract

Publication series

Access to Document

Fingerprint

Cite this