All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Edge routing and bundling for graphs with fixed node positions

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Edge routing and bundling for graphs with fixed node positions

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F10%2F0761" target="_blank" >GAP202/10/0761: Web Semantization</a><br>

  • Continuities

    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

Others

  • Publication year

    2011

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    2011 15th International Conference on Information Visualisation

  • ISBN

    978-0-7695-4476-2

  • ISSN

    1550-6037

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    475-481

  • Publisher name

    IEEE Computer Society

  • Place of publication

    Los Alamitos, CA, USA

  • Event location

    London, United Kingdom

  • Event date

    Jul 12, 2011

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article