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 .
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 .
D
general
R
show that the resulting drawings are not strictly guaranteed to be confluent due to potential corner cases that do not satisfy the original definition
identify two problems with their method and offer a single solution to solve both
R
reframe their work within the context of previous literature on using auxiliary graphs for bundling, which will
recognize a limitation regarding planarity, and
R
in this area
by introducing a new classification of 'power-confluent' drawing