Line Crossing Minimization on Metro Maps

DOI10.1007/978-3-540-77537-9_24zbMath1137.68467OpenAlexW2114857285MaRDI QIDQ5452227

Antonios Symvonis, Michael A. Bekos, Katerina Potika, Michael Kaufmann

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_24

zbMATH Keywords

TreesPathsLinesCrossing MinimizationMetro Maps

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Edge routing with ordered bundles ⋮ Parameterized analysis and crossing minimization problems ⋮ Crossing Minimization in Storyline Visualization ⋮ Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem ⋮ Line Crossing Minimization on Metro Maps

Cites Work

• Unnamed Item
• Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
• Crossing minimization in linear embeddings of graphs
• Line Crossing Minimization on Metro Maps
• Graph Drawing
• Graph Drawing
• Drawing graphs. Methods and models

This page was built for publication: Line Crossing Minimization on Metro Maps