Full metadata record
DC FieldValueLanguage
dc.contributor.authorJünger, Michael-
dc.contributor.authorMutzel, Petra-
dc.contributor.authorSpisla, Christiane-
dc.date.accessioned2019-11-25T15:09:27Z-
dc.date.available2019-11-25T15:09:27Z-
dc.date.issued2018-06-26-
dc.identifier.urihttp://hdl.handle.net/2003/38401-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-20333-
dc.description.abstractCompacting 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.language.isoende
dc.relation.ispartofseriesInformation;Jg. 9, Heft 7. S. 153-1-153-24-
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/.-
dc.subjectOrthogonal compactionen
dc.subjectGraph drawingen
dc.subjectTotal edge lengthen
dc.subjectBendsen
dc.subjectFlow-based compactionen
dc.subject.ddc004-
dc.titleMore compact orthogonal drawings by allowing additional bendsen
dc.typeTextde
dc.type.publicationtypearticlede
dc.subject.rswkGraphenzeichnende
dcterms.accessRightsopen access-
eldorado.secondarypublicationtruede
eldorado.secondarypublication.primaryidentifierhttps://doi.org/10.3390/info9070153de
eldorado.secondarypublication.primarycitationInformation : Jg. 9. 2018, Heft: 7 | S. 153-1-153-24en
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



This item is licensed under a Creative Commons License Creative Commons