About: Edge routing and bundling for graphs with fixed node positions

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

About: Edge routing and bundling for graphs with fixed node positions Goto Sponge NotDistinct 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
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 to the 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. 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 to the 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. (en)
Title	Edge routing and bundling for graphs with fixed node positions Edge routing and bundling for graphs with fixed node positions (en)
skos:prefLabel	Edge routing and bundling for graphs with fixed node positions Edge routing and bundling for graphs with fixed node positions (en)
skos:notation	RIV/00216208:11320/11:10099575!RIV12-GA0-11320___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GAP202/10/0761), S, Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Čermák, Miroslav Dokulil, Jiří
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	196033
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/11:10099575
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	edge bundling; edge routing (en)
http://linked.open.../riv/klicoveSlovo	edge bundling edge routing
http://linked.open...ontrolniKodProRIV	[000C886672FF]
http://linked.open...v/mistoKonaniAkce	London, United Kingdom
http://linked.open...i/riv/mistoVydani	Los Alamitos, CA, USA
http://linked.open...i/riv/nazevZdroje	2011 15th International Conference on Information Visualisation
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Web Semantization
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Dokulil, Jiří Katerniaková, Jana Čermák, Miroslav
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-07-12 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
issn	1550-6037
number of pages	7 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/IV.2011.47
http://purl.org/ne...btex#hasPublisher	IEEE Computer Society
https://schema.org/isbn	978-0-7695-4476-2
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software