Edge Routing with Fixed Node Positions

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F08%3A00101221" target="_blank" >RIV/00216208:11320/08:00101221 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Edge Routing with Fixed Node Positions
Original language description
The two basic problems of graph drawing - drawing of nodes and drawing of edges - are often handled by one algorithm that finds suitable positions for both nodes and edges. However, there are situations where positions of nodes are fixed, for instance ifthey were defined by the user or the exact position of the nodes is somehow significant. In these cases we need an algorithm that draws only the edges no matter what the positions of the nodes are. This paper presents one such algorithm. We present thevery basic version of the algorithm followed by two ways of improving it to produce better looking and clearer results.
Czech name
Vedení hran v nakreslení grafu s pevnou polohou vrcholů
Czech description
Vedení hran v nakreslení grafu s pevnou polohou vrcholů

Project
<a href="/en/project/GD201%2F05%2FH014" target="_blank" >GD201/05/H014: Collegium Informaticum</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

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

Article name in the collection
12th International Conference Information Visualization (IV '08)
ISBN
978-0-7695-3268-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos
Event location
Los Alamitos
Event date
Jan 1, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000259178400096

Similar results(10)