Path Simplification for Metro Map Layout
DOI10.1007/978-3-540-70904-6_26zbMATH Open1185.68490OpenAlexW1503429870MaRDI QIDQ3595458FDOQ3595458
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
Recommendations
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)
Cited In (15)
- A deformation algorithm of railway maps
- Line Crossing Minimization on Metro Maps
- On the Hardness of Orthogonal-Order Preserving Graph Drawing
- Graph Drawing
- Stabbing segments with rectilinear objects
- Drawing metro maps using Bézier curves
- On \(d\)-regular schematization of embedded paths
- Ordering Metro Lines by Block Crossings
- Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
- Schematization of networks
- Schematisation of Tree Drawings
- Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
- Shortest-Paths Preserving Metro Maps
- Map simplification with topology constraints: exactly and in practice
- 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)
