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.

[img] Postscript - Requires a viewer, such as GSview
Download (10MB)

Abstract

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.

Item Type: Departmental Technical Report
Additional Information: 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.
Classifications: P Styles > P.420 Hyper
M Methods > M.500 Layered
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/585

Available Versions of this Item

Actions (login required)

View Item View Item