http://gdea.informatik.uni-koeln.de/585/ 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. 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 [12] for a project that targeted electrical signal visualization. Sander, Georg P.420 M.500 P.600.700 Layout of Directed Hypergraphs with Orthogonal Hyperedges 2005-05-20 Sander, Georg (2003) Layout of Directed Hypergraphs with Orthogonal Hyperedges. [Conference Paper] (Unpublished) application/postscript