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

PathsTreesLinesCrossing MinimizationMetro Maps

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)

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

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

Cited in

(17)

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

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)