Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps

DOI10.1007/978-3-540-70904-6_27zbMATH Open1185.68459OpenAlexW1564822866MaRDI QIDQ3595490FDOQ3595490

Authors: Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff 

Publication date: 28 August 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_27

Recommendations

• On metro-line crossing minimization
• Line Crossing Minimization on Metro Maps
• Ordering Metro Lines by Block Crossings
• Ordering metro lines by block crossings
• Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

Mathematics Subject Classification ID

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

Cited In (5)

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

This page was built for publication: Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps

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