Layout of Directed Hypergraphs with Orthogonal Hyperedges (Extended Abstract)

Sander, Georg (2004) Layout of Directed Hypergraphs with Orthogonal Hyperedges (Extended Abstract). In: Graph Drawing, 2003 , pp. 381-386.

WarningThere is a more recent version of this item available.
Full text not available from this repository.

Abstract

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 [8,11]. The algorithm was implemented using ILOG JViews [10] for a project that targeted electrical signal visualization.

Item Type: Conference Paper
Classifications: P Styles > P.420 Hyper
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/467

Available Versions of this Item

Actions (login required)

View Item View Item