<div class="csl-bib-body">
<div class="csl-entry">Wallinger, M., Archambault, D., Auber, D., Nöllenburg, M., & Peltonen, J. (2022). Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach. <i>IEEE Transactions on Visualization and Computer Graphics</i>, <i>28</i>(1), 313–323. https://doi.org/10.1109/tvcg.2021.3114795</div>
</div>
-
dc.identifier.issn
1077-2626
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/136523
-
dc.description.abstract
Edge bundling techniques cluster edges with similar attributes (i.e. similarity in direction and proximity) together to reduce the visual clutter. All edge bundling techniques to date implicitly or explicitly cluster groups of individual edges, or parts of them, together based on these attributes. These clusters can result in ambiguous connections that do not exist in the data. Confluent drawings of networks do not have these ambiguities, but require the layout to be computed as part of the bundling process. We devise a new bundling method, Edge-Path bundling, to simplify edge clutter while greatly reducing ambiguities compared to previous bundling techniques. Edge-Path bundling takes a layout as input and clusters each edge along a weighted, shortest path to limit its deviation from a straight line. Edge-Path bundling does not incur independent edge ambiguities typically seen in all edge bundling methods, and the level of bundling can be tuned through shortest path distances, Euclidean distances, and combinations of the two. Also, directed edge bundling naturally emerges from the model. Through metric evaluations, we demonstrate the advantages of Edge-Path bundling over other techniques.
en
dc.language.iso
en
-
dc.publisher
Institute of Electrical and Electronics Engineers (IEEE)
-
dc.relation.ispartof
IEEE Transactions on Visualization and Computer Graphics
-
dc.subject
Software
-
dc.subject
Computer Graphics and Computer-Aided Design
-
dc.subject
Computer Vision and Pattern Recognition
-
dc.subject
Signal Processing
-
dc.title
Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach
en
dc.type
Artikel
de
dc.type
Article
en
dc.contributor.affiliation
Swansea University, United Kingdom of Great Britain and Northern Ireland (the)
-
dc.contributor.affiliation
Université de Bordeaux, France
-
dc.contributor.affiliation
Tampere University, Finland
-
dc.description.startpage
313
-
dc.description.endpage
323
-
dc.type.category
Original Research Article
-
tuw.container.volume
28
-
tuw.container.issue
1
-
tuw.journal.peerreviewed
true
-
tuw.peerreviewed
true
-
wb.publication.intCoWork
International Co-publication
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
dcterms.isPartOf.title
IEEE Transactions on Visualization and Computer Graphics
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publisher.doi
10.1109/tvcg.2021.3114795
-
dc.identifier.eissn
1941-0506
-
dc.description.numberOfPages
11
-
wb.sci
true
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.facultyfocus
Logic and Computation (LC)
de
wb.facultyfocus
Logic and Computation (LC)
en
wb.facultyfocus.faculty
E180
-
item.languageiso639-1
en
-
item.grantfulltext
none
-
item.cerifentitytype
Publications
-
item.openairetype
research article
-
item.openairecristype
http://purl.org/coar/resource_type/c_2df8fbb1
-
item.fulltext
no Fulltext
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
Université de Bordeaux
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity