Shortest-Paths Preserving Metro Maps

DOI10.1007/978-3-642-25878-7_45MaRDI QIDQ3223983zbMATH OpenOpenAlexFDO

Authors Tal Milea, Okke Schrijvers, Kevin Buchin, Herman Haverkort

Publication date 9 March 2012

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25878-7_45

Mathematics Subject Classification ID

Mathematics and visual arts (00A66) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Path based algorithms for metro network design
• Path Simplification for Metro Map Layout
• Line Crossing Minimization on Metro Maps
• Graph Drawing
• scientific article; zbMATH DE number 3952519
• scientific article; zbMATH DE number 1054931

Cited in

(3)

• Painting new lines: maximizing color difference in metro maps
• Line Crossing Minimization on Metro Maps
• Automatic generation of diagrammatic subway maps for any date with Maple

This page was built for publication: Shortest-Paths Preserving Metro Maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3223983)