Shortest-Paths Preserving Metro Maps
| Autor: | Milea, T.Y., Schrijvers, O.J., Buchin, K., Haverkort, H.J., Kreveld, van, M.J., Speckmann, B. |
|---|---|
| Přispěvatelé: | Algorithms |
| Rok vydání: | 2012 |
| Předmět: | |
| Zdroj: | Graph Drawing ISBN: 9783642258770 Graph Drawing Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers), 445-446 STARTPAGE=445;ENDPAGE=446;TITLE=Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers) |
| DOI: | 10.1007/978-3-642-25878-7_45 |
| Popis: | 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]. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|