Comments on "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization"

23 Oct 2018 · Jonathan X. Zheng, Samraat Pawar, Dan F. M. Goodman ·

Bach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We identify two problems with their method and offer a single solution to solve both. We then recognize a limitation regarding planarity, and help to guide future research by introducing a new classification of 'power-confluent' drawing.

PDF Abstract

Code

Add Remove Mark official

jxz12/pconfluent official

Datasets

Add Datasets introduced or used in this paper

Edit Social Preview

Comments on "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization"

Code Edit Add Remove Mark official

Categories

Datasets Edit

Code

Add Remove Mark official

Datasets