Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization
Abstract:
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 issues with their method which we call the node split and short-circuit problems, and solve both by modifying the routing graph to retain the hierarchical structure of power groups. We also classify the exact type of confluent drawings that the algorithm can produce as 'power-confluent', and prove that it is a subclass of the previously studied 'strict confluent' drawing. A description and source code of our implementation is also provided, which additionally includes an improved method for power graph construction.
Related Concept Videos
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
pV-Diagrams
Design Example: Analyzing Capacity Contours for Flood Risk Assessment
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Circuit Terminology
A circuit, on the other hand, is also an interconnected system of electrical elements but must contain one or more closed paths.
Elements of Block Diagrams
A block diagram typically includes essential elements such as comparators, blocks, and feedback loops. Each of these elements...


