More compact orthogonal drawings by allowing additional bends
| dc.contributor.author | Jünger, Michael | |
| dc.contributor.author | Mutzel, Petra | |
| dc.contributor.author | Spisla, Christiane | |
| dc.date.accessioned | 2019-11-25T15:09:27Z | |
| dc.date.available | 2019-11-25T15:09:27Z | |
| dc.date.issued | 2018-06-26 | |
| dc.description.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. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/38401 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-20333 | |
| dc.language.iso | en | de |
| dc.relation.ispartofseries | Information;Jg. 9, Heft 7. S. 153-1-153-24 | |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/. | |
| dc.subject | Orthogonal compaction | en |
| dc.subject | Graph drawing | en |
| dc.subject | Total edge length | en |
| dc.subject | Bends | en |
| dc.subject | Flow-based compaction | en |
| dc.subject.ddc | 004 | |
| dc.subject.rswk | Graphenzeichnen | de |
| dc.title | More compact orthogonal drawings by allowing additional bends | en |
| dc.type | Text | de |
| dc.type.publicationtype | article | de |
| dcterms.accessRights | open access | |
| eldorado.secondarypublication | true | de |
| eldorado.secondarypublication.primarycitation | Information : Jg. 9. 2018, Heft: 7 | S. 153-1-153-24 | en |
| eldorado.secondarypublication.primaryidentifier | https://doi.org/10.3390/info9070153 | de |