Shortest Path Approach to Edge Routing
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Shortest Path Approach to Edge Routing
Original language description
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
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA13-08195S" target="_blank" >GA13-08195S: Highly Scalable Parallel and Distributed Methods of Data Processing in E-science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
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
17th International Conference on Information Visualisation
ISBN
978-0-7695-5049-7
ISSN
1550-6037
e-ISSN
—
Number of pages
7
Pages from-to
428-434
Publisher name
IEEE Computer Society's Conference Publishing Services
Place of publication
Neuveden
Event location
London
Event date
Jul 16, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—