Shortest Path Approach to Edge Routing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10139276" target="_blank" >RIV/00216208:11320/13:10139276 - isvavai.cz</a>

Výsledek na webu

<a href="http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6676597" target="_blank" >http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6676597</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Shortest Path Approach to Edge Routing

Popis výsledku v původním jazyce

Traditionally, drawing of edges is performed together with drawing of nodes. However, there are situations where positions of the nodes are ?xed, e.g., when the positions are de?ned by the user or a separate algorithm. An example of this situation is a database schema editor, where user positions the nodes (i.e., visual representations of de?nitions of individual database tables) according to their meaning, for example grouping them according to subdomains of the problem. In this case, we only need to draw the edges but we must do that in such a way that the lines that represent these edges do not cross the rectangles that represent the nodes - we need to perform some kind of edge routing. This paper describes an algorithm that performs edge routing insuch a way that the lengths of the polylines it produces are minimal. We also describe several ways of improving the performance of the basic algorithm so that it can be used even for interactive graph visualization and manipulation, whi

Název v anglickém jazyce

Shortest Path Approach to Edge Routing

Popis výsledku anglicky

Traditionally, drawing of edges is performed together with drawing of nodes. However, there are situations where positions of the nodes are ?xed, e.g., when the positions are de?ned by the user or a separate algorithm. An example of this situation is a database schema editor, where user positions the nodes (i.e., visual representations of de?nitions of individual database tables) according to their meaning, for example grouping them according to subdomains of the problem. In this case, we only need to draw the edges but we must do that in such a way that the lines that represent these edges do not cross the rectangles that represent the nodes - we need to perform some kind of edge routing. This paper describes an algorithm that performs edge routing insuch a way that the lengths of the polylines it produces are minimal. We also describe several ways of improving the performance of the basic algorithm so that it can be used even for interactive graph visualization and manipulation, whi

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA13-08195S" target="_blank" >GA13-08195S: Vysoce škálovatelné paralelní a distribuované metody zpracování vědeckých dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

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

17th International Conference on Information Visualisation

ISBN

978-0-7695-5049-7

ISSN

1550-6037

e-ISSN

—

Počet stran výsledku

7

Strana od-do

428-434

Název nakladatele

IEEE Computer Society's Conference Publishing Services

Místo vydání

Neuveden

Místo konání akce

London

Datum konání akce

16. 7. 2013

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

WRD - Celosvětová akce

Kód UT WoS článku

—