Six methods for transforming layered hypergraphs to apply layered graph layout algorithms

  author   = {Di~Bartolomeo, Sara and Pister, Alexis and Buono, Paolo and Plaisant, Catherine and Dunne, Cody and Fekete, Jean-Daniel},
  journal  = {Computer Graphics Forum},
  title    = {Six methods for transforming layered hypergraphs to apply layered graph layout algorithms},
  year     = {2022},
  note     = {EuroVis '22. Preprint \& supplemental material: \url{}},
  number   = {3},
  pages    = {259--270},
  volume   = {41},
  abstract = {Abstract Hypergraphs are a generalization of graphs in which edges (hyperedges) can connect more than two vertices—as opposed to ordinary graphs where edges involve only two vertices. Hypergraphs are a fairly common data structure but there is little consensus on how to visualize them. To optimize a hypergraph drawing for readability, we need a layout algorithm. Common graph layout algorithms only consider ordinary graphs and do not take hyperedges into account. We focus on layered hypergraphs, a particular class of hypergraphs that, like layered graphs, assigns every vertex to a layer, and the vertices in a layer are drawn aligned on a linear axis with the axes arranged in parallel. In this paper, we propose a general method to apply layered graph layout algorithms to layered hypergraphs. We introduce six different transformations for layered hypergraphs. The choice of transformation affects the subsequent graph layout algorithm in terms of computational performance and readability of the results. Thus, we perform a comparative evaluation of these transformations in terms of number of crossings, edge length, and impact on performance. We also provide two case studies showing how our transformations can be applied to real-life use cases. A copy of this paper with all appendices and supplemental material is available at},
  doi      = {10.1111/cgf.14538},
  series   = {EuroVis/CGF},

Cody Dunne, Vis Lab — Northeastern University
West Village H, Room 302F
440 Huntington Ave, Boston, MA 02115, USA