On d-Regular Schematization of Embedded Paths

DOI10.1007/978-3-642-18381-2_22zbMath1298.68279OpenAlexW2110612202MaRDI QIDQ3075524

Ignaz Rutter, Thomas Pajor, Martin Nöllenburg, Andreas Gemsa

Publication date: 15 February 2011

Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_22

Mathematics Subject Classification ID

Mixed integer programming (90C11) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(d\)-regular schematization of embedded paths
• Path Schematization for Route Sketches
• Path Simplification for Metro Map Layout
• On the Hardness of Orthogonal-Order Preserving Graph Drawing
• Schematization of road networks
• Graph Drawing
• Graph Drawing

This page was built for publication: On d-Regular Schematization of Embedded Paths