title: Layout of Directed Hypergraphs with Orthogonal Hyperedges
creator: Sander, Georg
subject: P.420 Hyper
subject: M.500 Layered
subject: P.600.700 Orthogonal
description: 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.  
date: 2003
type: Conference Paper
type: PeerReviewed
format: application/postscript
identifier: http://gdea.informatik.uni-koeln.de/585/1/hypergraph.ps
identifier: Sander, Georg (2003) Layout of Directed Hypergraphs with Orthogonal Hyperedges. [Conference Paper] (Unpublished)
relation: http://gdea.informatik.uni-koeln.de/585/