We address the problem of drawing hypergraphs. We propose and evaluate a family of algorithms that transform a hypergraph drawing problem into a graph drawing problem. Each algorithm in the family relies on a different encoding of a hyperedge into a set of edges. The algorithms can then use any graph drawing algorithms. However, we here focus on the force-directed algorithms. We propose and dis...

We consider the recently introduced model of low ply graph drawing, a straight-line drawing in which the ply-disks of the vertices do not have many common overlaps, which results in a good distribution of the vertices in the plane. The ply-disk of a vertex is the disk centered at it whose radius is half the length of its longest incident edge. We focus our attention on low-ply drawings of trees...