Drawing Hypergraphs in the Subset Standard (Short Demo Paper)

Abstract

Abstract.We report an experience on a practical system for drawing hypergraphs in the subset standard. The Patate system is based on the application of a classical force directed method to a dynamic graph, which is deduced, at a given iteration time, from the hypergraph structure and particular vertex locations. Different strategies to define the dynamic underlying graph are presented. We illustrate in particular the method when the graph is obtained by computing an Euclidean Steiner tree.

Visualization of Intersecting Groups Based on Hypergraphs

“…Bertault and Eades [5] propose several methods to build the graph corresponding to a given hypergraph that give reasonable results for small hypergraphs, but becomes too cluttered when the number of nodes, the size of hyperedges and the degree of overlapping grow. 20 nodes, with about 10 hyperedges of length (at most) 5 are enough to clutter the visualization.…”

“…When the complexity of data grows, it is useful to abstract from basic groups to intersection groups that may show, for example, consensus on gene groups, coincidence [4] low (3)(4)(5)(6)(7)(8) yes no contours Subset standard [5] low (∼ 10) yes points contours BiVoc [6] medium (∼ 20) yes (duplications) rows and columns rectangles Johnson and Krempel [7] low yes (projection) piecharts projected to a grid lines KartOO [8] low yes (projection) icons surfaces HCG [9] medium (∼ 20) inclusion no polygons Compound Graphs [10] medium (∼ 50) inclusion labels rectangles SocialAction [11] medium (∼ 20) no labels colored areas Vizster [12] medium (∼ 20) no icons colored areas Omote and Sugiyama [13] on database searches or relevance on social groups. Transparency and the design of special icons will be used in order to achieve this.…”

Subdivision Drawings of Hypergraphs

“…Hence, modulo re-labeling of vertices and the removal of white non-vertex faces, we must have a subdivision drawing as the one depicted in Fig. 5(a) with a non-simple hyperedge region for hyperedge (2,3,4). Second, consider the hypergraph H 2 that is schematically depicted in Fig.…”

“…Subset-based drawings neither know any concept of or experience any problems with planarity. Bertault and Eades [2] show how to create subset-based hypergraph drawings.…”

“…2(a, b)). Concerning vertex-planarity, consider the following hypergraph H: H has six vertices and three hyperedges (1, 2, 3, 4), (1,2,3,5), and (1, 2, 3, 6). H is vertex-planar but not (Zykov-)planar.…”