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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Sander, G. (2004). Layout of directed hypergraphs with orthogonal hyperedges. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 381–386. https://doi.org/10.1007/978-3-540-24595-7_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
