This HTML5 document contains 47 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n24http://localhost/temp/predkladatel/
n13http://purl.org/net/nknouf/ns/bibtex#
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n4http://linked.opendata.cz/resource/domain/vavai/projekt/
n19http://linked.opendata.cz/resource/domain/vavai/subjekt/
n8http://linked.opendata.cz/ontology/domain/vavai/
n23https://schema.org/
n22http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n20http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F11%3A10099575%21RIV12-GA0-11320___/
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n11http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F11%3A10099575%21RIV12-GA0-11320___
rdf:type
skos:Concept n8:Vysledek
dcterms: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.
dcterms:title
Edge routing and bundling for graphs with fixed node positions Edge routing and bundling for graphs with fixed node positions
skos:prefLabel
Edge routing and bundling for graphs with fixed node positions Edge routing and bundling for graphs with fixed node positions
skos:notation
RIV/00216208:11320/11:10099575!RIV12-GA0-11320___
n8:predkladatel
n19:orjk%3A11320
n3:aktivita
n18:S n18:P n18:Z
n3:aktivity
P(GAP202/10/0761), S, Z(MSM0021620838)
n3:dodaniDat
n12:2012
n3:domaciTvurceVysledku
n17:1365177 n17:2841258
n3:druhVysledku
n15:D
n3:duvernostUdaju
n21:S
n3:entitaPredkladatele
n20:predkladatel
n3:idSjednocenehoVysledku
196033
n3:idVysledku
RIV/00216208:11320/11:10099575
n3:jazykVysledku
n9:eng
n3:klicovaSlova
edge bundling; edge routing
n3:klicoveSlovo
n14:edge%20bundling n14:edge%20routing
n3:kontrolniKodProRIV
[000C886672FF]
n3:mistoKonaniAkce
London, United Kingdom
n3:mistoVydani
Los Alamitos, CA, USA
n3:nazevZdroje
2011 15th International Conference on Information Visualisation
n3:obor
n10:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
3
n3:projekt
n4:GAP202%2F10%2F0761
n3:rokUplatneniVysledku
n12:2011
n3:tvurceVysledku
Dokulil, Jiří Čermák, Miroslav Katerniaková, Jana
n3:typAkce
n16:WRD
n3:zahajeniAkce
2011-07-12+02:00
n3:zamer
n22:MSM0021620838
s:issn
1550-6037
s:numberOfPages
7
n11:doi
10.1109/IV.2011.47
n13:hasPublisher
IEEE Computer Society
n23:isbn
978-0-7695-4476-2
n24:organizacniJednotka
11320