Edge routing and bundling for graphs with fixed node positions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10099575" target="_blank" >RIV/00216208:11320/11:10099575 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/IV.2011.47" target="_blank" >http://dx.doi.org/10.1109/IV.2011.47</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/IV.2011.47" target="_blank" >10.1109/IV.2011.47</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Edge routing and bundling for graphs with fixed node positions

Popis výsledku v původním jazyce

In some graph drawing scenarios, the positions of the nodes are already defined and cannot be modified (for example, they were provided by the user) and the graph drawing techniques are only used to draw edges between the nodes. The number of nodes in such cases tends to be relatively small (tens or hundreds of nodes at most) however the users want to see all of the edges. Various edge routing techniques can provide such services, but if the graph is dense, the drawing can get rather hard to read due tothe high number of lines required to visualize the edges. In such cases, clarity can be improved by bundling individual edges (more precisely parts of their drawing) into larger groups and draw as a single line. In this paper, we provide several different techniques for edge bundling based on an edge routing algorithm, compare and evaluate them.

Název v anglickém jazyce

Edge routing and bundling for graphs with fixed node positions

Popis výsledku anglicky

In some graph drawing scenarios, the positions of the nodes are already defined and cannot be modified (for example, they were provided by the user) and the graph drawing techniques are only used to draw edges between the nodes. The number of nodes in such cases tends to be relatively small (tens or hundreds of nodes at most) however the users want to see all of the edges. Various edge routing techniques can provide such services, but if the graph is dense, the drawing can get rather hard to read due tothe high number of lines required to visualize the edges. In such cases, clarity can be improved by bundling individual edges (more precisely parts of their drawing) into larger groups and draw as a single line. In this paper, we provide several different techniques for edge bundling based on an edge routing algorithm, compare and evaluate them.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F10%2F0761" target="_blank" >GAP202/10/0761: Semantizace webu</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

2011 15th International Conference on Information Visualisation

ISBN

978-0-7695-4476-2

ISSN

1550-6037

e-ISSN

—

Počet stran výsledku

7

Strana od-do

475-481

Název nakladatele

IEEE Computer Society

Místo vydání

Los Alamitos, CA, USA

Místo konání akce

London, United Kingdom

Datum konání akce

12. 7. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—