Comments on "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization"
Abstract. Bach et al. 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.