About: Shortest Path Approach to Edge Routing

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Shortest Path Approach to Edge Routing Goto Sponge Distinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6676597
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 in such 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, which is necessary in our scenario. Then, we show several post-processing steps that are used to turn the results of the algorithm into a usable visualization. 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 in such 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, which is necessary in our scenario. Then, we show several post-processing steps that are used to turn the results of the algorithm into a usable visualization. (en)
Title	Shortest Path Approach to Edge Routing Shortest Path Approach to Edge Routing (en)
skos:prefLabel	Shortest Path Approach to Edge Routing Shortest Path Approach to Edge Routing (en)
skos:notation	RIV/00216208:11320/13:10139276!RIV14-GA0-11320___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA13-08195S)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Bednárek, David
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	104974
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/13:10139276
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	edge routing; information visualization; graph drawing (en)
http://linked.open.../riv/klicoveSlovo	information visualization graph drawing edge routing
http://linked.open...ontrolniKodProRIV	[0F9B358BB27E]
http://linked.open...v/mistoKonaniAkce	London
http://linked.open...i/riv/mistoVydani	Neuveden
http://linked.open...i/riv/nazevZdroje	17th International Conference on Information Visualisation
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Vysoce škálovatelné paralelní a distribuované metody zpracování vědeckých dat
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Bednárek, David Dokulil, Jiří Katreniaková, Jana
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-07-16 (xsd:date)
issn	1550-6037
number of pages	7 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/IV.2013.97
http://purl.org/ne...btex#hasPublisher	IEEE Computer Society's Conference Publishing Services
https://schema.org/isbn	978-0-7695-5049-7
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 84 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software