Jünger, MichaelMutzel, PetraSpisla, Christiane2019-11-252019-11-252018-06-26http://hdl.handle.net/2003/3840110.17877/DE290R-20333Compacting 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.enInformation;Jg. 9, Heft 7. S. 153-1-153-24http://creativecommons.org/licenses/by/4.0/.Orthogonal compactionGraph drawingTotal edge lengthBendsFlow-based compaction004article (journal)Graphenzeichnen