Next Article in Journal / Special Issue
An Evolutionary Algorithm for an Optimization Model of Edge Bundling
Previous Article in Journal
Engineering Cheerful Robots: An Ethical Consideration
Open AccessArticle

More Compact Orthogonal Drawings by Allowing Additional Bends

1
Department of Mathematics and Computer Science, University of Cologne, 50923 Cologne, Germany
2
Department of Computer Science, TU Dortmund University, 44221 Dortmund, Germany
*
Author to whom correspondence should be addressed.
Information 2018, 9(7), 153; https://doi.org/10.3390/info9070153
Received: 30 April 2018 / Revised: 19 June 2018 / Accepted: 21 June 2018 / Published: 26 June 2018
(This article belongs to the Special Issue Selected Papers from IVAPP 2018)
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. View Full-Text
Keywords: orthogonal compaction; graph drawing; total edge length; Bends; flow-based compaction orthogonal compaction; graph drawing; total edge length; Bends; flow-based compaction
Show Figures

Figure 1

MDPI and ACS Style

Jünger, M.; Mutzel, P.; Spisla, C. More Compact Orthogonal Drawings by Allowing Additional Bends . Information 2018, 9, 153.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop