In this section
@article{Zheng:2021:10.1109/TVCG.2019.2944619,
author = {Zheng, JX and Pawar, S and Goodman, DFM},
doi = {10.1109/TVCG.2019.2944619},
journal = {IEEE Transactions on Visualization and Computer Graphics},
pages = {2244--2249},
title = {Further towards unambiguous edge bundling: Investigating power-confluentdrawings for network visualization},
url = {http://dx.doi.org/10.1109/TVCG.2019.2944619},
volume = {27},
year = {2021}
}
TY - JOUR
AB - Bach et al. [1] recently presented an algorithm for constructing confluentdrawings, by leveraging power graph decomposition to generate an auxiliaryrouting graph. We identify two problems with their method and offer a singlesolution to solve both. We also classify the exact type of confluent drawingsthat the algorithm can produce as 'power-confluent', and prove that it is asubclass of the previously studied 'strict confluent' drawing. A descriptionand source code of our implementation is also provided, which additionallyincludes an improved method for power graph construction.
AU - Zheng,JX
AU - Pawar,S
AU - Goodman,DFM
DO - 10.1109/TVCG.2019.2944619
EP - 2249
PY - 2021///
SN - 1077-2626
SP - 2244
TI - Further towards unambiguous edge bundling: Investigating power-confluentdrawings for network visualization
T2 - IEEE Transactions on Visualization and Computer Graphics
UR - http://dx.doi.org/10.1109/TVCG.2019.2944619
UR - http://arxiv.org/abs/1810.09948v3
UR - http://hdl.handle.net/10044/1/71989
VL - 27
ER -
Artificial Intelligence Network
South Kensington Campus
Imperial College London
SW7 2AZ
To reach the elected speaker of the network, Dr Rossella Arcucci, please contact:
To reach the network manager, Diana O'Malley - including to join the network - please contact: