Abstract. Hypergraphs can be used to model set systems by considering the elements as vertices and the different sets as hyperedges. The talk will first give an overview of different styles for visualizing set systems and how they relate to drawing hypergraphs. We will discuss different graph drawing techniques and algorithms that can be used for visualizing hypergraphs and sets. The focus of the talk is on region-based techniques in the style of Euler diagrams and on overlay techniques, where the set elements have pre-defined positions.
Martin Nöllenburg (website) is an associate professor in the Algorithms and Complexity Group at TU Wien, Vienna, Austria. His research interests include algorithmics and algorithm engineering, especially graph and geometric algorithms, with applications to graph drawing, cartography, and information visualization. He received his Master and PhD degrees in 2005 and 2009 from Karlsruhe Institute of Technology (KIT), Germany. After a postdoc at UC Irvine, CA, USA he returned to KIT in 2010 as head of a junior research group on algorithms for geovisualization and moved to TU Wien as an assistant professor in 2015. He has published more than 110 papers including work on theoretical foundations and algorithms for optimizing hypergraph and set visualizations using support graphs. In 2017 he co-organized a Dagstuhl seminar on Scalable Set Visualizations.