The metro map layout problem
From MaRDI portal
Recommendations
Cited in
(14)- Constrained graph layout by stress majorization and gradient projection
- The hardness of placing street names in a Manhattan type map
- A deformation algorithm of railway maps
- Ordering Metro Lines by Block Crossings
- Generating schematic cable plans using springembedder methods
- Painting new lines: maximizing color difference in metro maps
- Path Simplification for Metro Map Layout
- Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
- Fast layout methods for timetable graphs
- Using Graph Layout to Visualize Train Interconnection Data
- Drawing metro maps using Bézier curves
- Line Crossing Minimization on Metro Maps
- Graph Drawing
- Automatic generation of diagrammatic subway maps for any date with Maple
This page was built for publication: The metro map layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711634)