Просмотреть запись

Improving layered graph layouts with edge bundling

Электронный научный архив УРФУ

Информация об архиве | Просмотр оригинала
 
 
Поле Значение
 
Заглавие Improving layered graph layouts with edge bundling
 
Автор Pupyrev, S.
Nachmanson, L.
Kaufmann, M.
 
Тематика 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)
 
Описание 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.
 
Дата 2024-04-24T12:38:25Z
2024-04-24T12:38:25Z
2011
 
Тип book-chapter
Other (info:eu-repo/semantics/other)
info:eu-repo/publishedVersion
 
Идентификатор Pupyrev, S., Nachmanson, L., & Kaufmann, M. (2011). Improving layered graph layouts with edge bundling. In Lecture Notes in Computer Science. Graph Drawing (pp. 329–340). doi:10.1007/978-3-642-18469-7_30
978-3-64218468-0
0302-9743
Final
All Open Access, Bronze
https://link.springer.com/content/pdf/10.1007%2F978-3-642-18469-7_30.pdf
http://elar.urfu.ru/handle/10995/132594
10.1007/978-3-642-18469-7_30
 
Язык en
 
Права Open access (info:eu-repo/semantics/openAccess)
 
Формат application/pdf
 
Издатель Springer Berlin Heidelberg
 
Источник Lecture Notes in Computer Science
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)