Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/111368
Title: Improving Layered Graph Layouts with Edge Bundling
Authors: Pupyrev, S.
Nachmanson, L.
Kaufmann, M.
Issue Date: 2011
Publisher: Springer Berlin Heidelberg
Citation: Pupyrev S. Improving Layered Graph Layouts with Edge Bundling / S. Pupyrev, L. Nachmanson, M. Kaufmann. — DOI 10.17323/1814-9545-2021-3-8-32 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2011. — Vol. 6502 LNCS. — P. 329-340.
Abstract: We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced by the Sugiyama scheme by bundling some of the edges together. The bundles are created by a new algorithm based on minimizing the total ink needed to draw the graph edges. We give several implementations that vary in quality of the resulting layout and execution time. To diminish the number of edge crossings inside of the bundles we apply a metro-line crossing minimization technique. The method preserves the Sugiyama style of the layout and creates a more readable view of the graph. © 2011 Springer-Verlag.
Keywords: EDGE CROSSING
EXECUTION TIME
GRAPH EDGES
LAYERED GRAPHS
LINE CROSSINGS
EDGE BUNDLING
EDGE CROSSING
GRAPH EDGES
LAYERED GRAPHS
METRO LINES
OPTIMIZATION
ARTIFICIAL INTELLIGENCE
COMPUTER SCIENCE
COMPUTERS
DRAWING (GRAPHICS)
DRAWING (GRAPHICS)
URI: http://hdl.handle.net/10995/111368
Access: info:eu-repo/semantics/openAccess
Conference name: 18th International Symposium on Graph Drawing, GD 2010
Conference date: 21 September 2010 through 24 September 2010
SCOPUS ID: 79952265484
ISSN: 0302-9743
ISBN: 9783642184680
DOI: 10.17323/1814-9545-2021-3-8-32
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-79952265484.pdf479,47 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.