Layout of Directed Hypergraphs with Orthogonal Hyperedges
Sander, Georg (2003) Layout of Directed Hypergraphs with Orthogonal Hyperedges. [Departmental Technical Report] (Unpublished)
This is the latest version of this item.
We present a layout algorithm for directed hypergraphs. A hypergraph contains hyperedges that have multiple source and target nodes. The hyperedges are drawn with orthogonal segments. The 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 [10, 13]. The algorithm was implemented using ILOG JViews  for a project that targeted electrical signal visualization.
Available Versions of this Item
Repository Staff Only: item control page