A New Approximation Algorithm for Bend Minimization in the Kandinsky Model

DOI10.1007/978-3-540-70904-6_33zbMath1185.68846OpenAlexW1548674621MaRDI QIDQ3595481

Canan Yıldız, Petra Mutzel, W. Barth

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_33

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

Planar L-Drawings of Bimodal Graphs ⋮ Planar Confluent Orthogonal Drawings of 4-Modal Digraphs ⋮ Planar confluent orthogonal drawings of 4-modal digraphs ⋮ Planar L-Drawings of Directed Graphs ⋮ Planar L-Drawings of Bimodal Graphs

This page was built for publication: A New Approximation Algorithm for Bend Minimization in the Kandinsky Model