Line Crossing Minimization on Metro Maps

DOI10.1007/978-3-540-77537-9_24MaRDI QIDQ5452227zbMATH OpenOpenAlexFDO

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

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

Crossing MinimizationLinesMetro MapsPathsTrees

Mathematics Subject Classification ID

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

Recommendations

• On metro-line crossing minimization
• Metro-line crossing minimization: hardness, approximations, and tractable cases
• An improved algorithm for the metro-line crossing minimization problem
• Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
• Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
• Path Simplification for Metro Map Layout
• Shortest-Paths Preserving Metro Maps
• Graph Drawing
• Line planning with minimal traveling time
• Path based algorithms for metro network design

Cites work

• Crossing minimization in linear embeddings of graphs
• Drawing graphs. Methods and models
• Graph Drawing
• Graph Drawing
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• Line Crossing Minimization on Metro Maps
• Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps

Cited in

(19)

• Parameterized analysis and crossing minimization problems
• Edge routing with ordered bundles
• Ordering Metro Lines by Block Crossings
• Metro-line crossing minimization: hardness, approximations, and tractable cases
• Crossing Minimization in Storyline Visualization
• Painting new lines: maximizing color difference in metro maps
• Shortest-Paths Preserving Metro Maps
• On metro-line crossing minimization
• An improved algorithm for the metro-line crossing minimization problem
• Path Simplification for Metro Map Layout
• Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
• Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
• Drawing metro maps using Bézier curves
• Ordering metro lines by block crossings
• Line Crossing Minimization on Metro Maps
• Graph Drawing
• Graph Drawing
• Visualizing treewidth
• Visualizing treewidth

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

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