Path Simplification for Metro Map Layout

DOI10.1007/978-3-540-70904-6_26zbMath1185.68490OpenAlexW1503429870MaRDI QIDQ3595458

Joachim Gudmundsson, Damian Merrick

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 theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges ⋮ Stabbing segments with rectilinear objects ⋮ On the Hardness of Orthogonal-Order Preserving Graph Drawing ⋮ Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem ⋮ On d-Regular Schematization of Embedded Paths

This page was built for publication: Path Simplification for Metro Map Layout