%A Georg Sander
%O This is the long (full) version of paper ID 467.
The shorter version (extended abstract) was published on GD 2003 with Springer
and is in the data base under ID 467.
%T Layout of Directed Hypergraphs with Orthogonal Hyperedges
%X 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.

%D 2003
%K hypergraph, orthogonal, Sugyama layout, electrical diagram
%L gdea_3585