Graph Drawing

DOI10.1007/11618058zbMATH Open1171.68637OpenAlexW4251892597MaRDI QIDQ5897641FDOQ5897641

Authors: Martin Nöllenburg, Alexander Wolff 

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11618058

Recommendations

• Graph Drawing
• Line Crossing Minimization on Metro Maps
• On metro-line crossing minimization
• Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
• Using the metro-map metaphor for drawing hypergraphs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mixed integer programming (90C11) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (12)

• A deformation algorithm of railway maps
• Using Graph Layout to Visualize Train Interconnection Data
• Line Crossing Minimization on Metro Maps
• On the Hardness of Orthogonal-Order Preserving Graph Drawing
• Graph Drawing
• Painting new lines: maximizing color difference in metro maps
• Drawing metro maps using Bézier curves
• On \(d\)-regular schematization of embedded paths
• Efficient automated schematic map drawing using multiobjective mixed integer programming
• Automatic generation of diagrammatic subway maps for any date with Maple
• Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
• Shortest-Paths Preserving Metro Maps

This page was built for publication: Graph Drawing

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