Authors: Alexander Dobler ¹; Stephen Kobourov ²; Debajyoti Mondal ³; Martin Nöllenburg ¹

• 1 TU Wien [TUW]
• 2 Technical University of Munich [TUM]
• 3 University of Saskatchewan [USASK]

We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, we consider several different variants of this problem by (a) restricting the curves to be lines or line segments, (b) allowing two curves to cross if they do not share an element, or not; and (c) allowing two curves to overlap or not. We show $\exists\mathbb{R}$-hardness for six of the eight resulting decision problem variants and describe polynomial-time algorithms in some restricted settings. Lastly, we briefly touch on what happens if we allow the lines of the represented hyperedges to have bends - to this we generalize a counterexample to a long-standing result that was sometimes assumed to be correct.

24 pages, 12 figures