Authors: Jünger, Michael
Mutzel, Petra
Spisla, Christiane
Title: More compact orthogonal drawings by allowing additional bends
Language (ISO): en
Abstract: Compacting orthogonal drawings is a challenging task. Usually, algorithms try to compute drawings with small area or total edge length while preserving the underlying orthogonal shape. We suggest a moderate relaxation of the orthogonal compaction problem, namely the one-dimensional monotone flexible edge compaction problem with fixed vertex star geometry. We further show that this problem can be solved in polynomial time using a network flow model. An experimental evaluation shows that by allowing additional bends could reduce the total edge length and the drawing area.
Subject Headings: Orthogonal compaction
Graph drawing
Total edge length
Bends
Flow-based compaction
Subject Headings (RSWK): Graphenzeichnen
URI: http://hdl.handle.net/2003/38401
http://dx.doi.org/10.17877/DE290R-20333
Issue Date: 2018-06-26
Rights link: http://creativecommons.org/licenses/by/4.0/.
Appears in Collections:LS 11

Files in This Item:
File Description SizeFormat 
information-09-00153.pdf2.33 MBAdobe PDFView/Open


This item is protected by original copyright



All resources in the repository are protected by copyright.