Layout of Directed Hypergraphs with Orthogonal Hyperedges

摘要

We present a layout algorithm for directed hypergraphs. A hypergraph contains hyperedges that have multiple source and target nodes. Hyperedges are drawn with orthogonal segments. Nodes are organized in layers, so that for the majority of hyperedges the source nodes are placed in a higher layer than the target nodes, similar to traditional hierarchical layout. The algorithm was implemented using ILOG JViews for a project that targeted electrical signal visualization.