Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
From MaRDI portal
Publication:3595490
DOI10.1007/978-3-540-70904-6_27zbMath1185.68459OpenAlexW1564822866MaRDI QIDQ3595490
Marc Benkert, Alexander Wolff, Takeaki Uno, Martin Nöllenburg
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_27
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Edge routing with ordered bundles ⋮ Parameterized analysis and crossing minimization problems ⋮ Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem ⋮ Line Crossing Minimization on Metro Maps
This page was built for publication: Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
