Path Simplification for Metro Map Layout

DOI10.1007/978-3-540-70904-6_26MaRDI QIDQ3595458zbMATHOpenAlexFDO

Authors Damian Merrick, Joachim Gudmundsson

Publication date 28 August 2007

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70904-6_26

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) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Recommendations

• Schematization of road networks
• Schematization of networks
• Line Crossing Minimization on Metro Maps
• Graph Drawing
• Path Schematization for Route Sketches

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)