Path Simplification for Metro Map Layout
From MaRDI portal
Publication:3595458
Recommendations
Cited in
(14)- A deformation algorithm of railway maps
- Shortest-Paths Preserving Metro Maps
- Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
- Ordering Metro Lines by Block Crossings
- Schematization of networks
- On \(d\)-regular schematization of embedded paths
- Graph Drawing
- Map simplification with topology constraints: exactly and in practice
- Schematisation of Tree Drawings
- Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
- Drawing metro maps using Bézier curves
- Line Crossing Minimization on Metro Maps
- On the Hardness of Orthogonal-Order Preserving Graph Drawing
- On \(d\)-regular schematization of embedded paths
This page was built for publication: Path Simplification for Metro Map Layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595458)