Bend Minimization in Orthogonal Drawings Using Integer Programming

We consider the problem of minimizing the number of bends in an orthogonal planar graph drawing. While the problem can be solved via network flow for a given planar embedding of a graph G, it is NP-hard if we consider the set of all planar embeddings of G. Our approach combines an integer linear pro...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Mutzel, Petra, Weiskircher, René
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!