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

10/23/2018

∙

by   Jonathan X. Zheng, et al.

∙

0

∙

share

Bach et al. [1] recently presented an algorithm for constructing general confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We show that the resulting drawings are not strictly guaranteed to be confluent due to potential corner cases that do not satisfy the original definition. We then reframe their work within the context of previous literature on using auxiliary graphs for bundling, which will help to guide future research in this area.