Edge bundling is a well-known technique to reduce visual clutter in node-link diagrams by having different links share the same path through the diagram [1-4]. Dataflow diagrams consist of functional blocks (nodes) that transfer data through channels (links or edges, usually routed orthogonally) that connect the blocks through dedicated connection points (ports). A natural concept of dataflow diagrams which is similar to edge bundling is the usage of hyperedges which can connect more than two nodes. Here we show how edge bundles can sensibly be incorporated into dataflow diagrams and how they compare to and can coexist with hyperedges. We briefly discuss methods to compute edge bundles as part of the layer-based approach to layout [7].
展开▼
