Shortest-paths preserving metro maps

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)

Samenvatting

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].
Originele taal-2Engels
TitelGraph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers)
RedacteurenM.J. Kreveld, van, B. Speckmann
Plaats van productieBerlin
UitgeverijSpringer
Pagina's445-446
ISBN van geprinte versie978-3-642-25877-0
DOI's
StatusGepubliceerd - 2012

Publicatie series

NaamLecture Notes in Computer Science
Volume7034
ISSN van geprinte versie0302-9743

Vingerafdruk Duik in de onderzoeksthema's van 'Shortest-paths preserving metro maps'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit

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