Multi-level verticality optimization:Concept, strategies, and drawing scheme

DC FieldValueLanguage
dc.contributor.authorChimani, M.
dc.contributor.authorHungerländer, P.
dc.date.accessioned2021-12-23T16:30:29Z-
dc.date.available2021-12-23T16:30:29Z-
dc.date.issued2013
dc.identifier.issn15261719
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/16602-
dc.description.abstractIn traditional multi-level graph drawing-known as Sugiyama's framework-the number of crossings is considered one of the most important goals. Herein, we propose the alternative concept of optimizing the verticality of the drawn edges. We formally specify the problem, discuss its relative merits, and show that drawings that are good w.r.t. verticality in fact also have a low number of crossings. We present heuristic and exact approaches to tackle the verticality problem and study them in practice. Furthermore, we present a new drawing scheme (inherently bundling edges and drawing them monotonously), especially suitable for verticality optimization. It works without the traditional subdivision of edges, i.e., edges may span multiple levels, and therefore potentially allows to tackle larger graphs.
dc.language.isoen
dc.relation.ispartofJournal of Graph Algorithms and Applications
dc.titleMulti-level verticality optimization:Concept, strategies, and drawing scheme
dc.typejournal article
dc.identifier.doi10.7155/jgaa.00296
dc.identifier.scopus2-s2.0-84880813528
dc.identifier.urlhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84880813528&doi=10.7155%2fjgaa.00296&partnerID=40&md5=d247b51432333151bba19e3905ce2c34
dc.description.volume17
dc.description.issue3
dc.description.startpage329
dc.description.endpage362
dcterms.isPartOf.abbreviationJ. Graph Algorithms and Appl.
crisitem.author.orcid0000-0002-4681-5550-
crisitem.author.netidChMa572-
Show simple item record

Page view(s)

5
Last Week
0
Last month
0
checked on May 27, 2024

Google ScholarTM

Check

Altmetric