Graph Drawing

Volume 5417 of the series Lecture Notes in Computer Science pp 396-407

Subdivision Drawings of Hypergraphs

  • Michael KaufmannAffiliated withInstitut für Informatik, Universität Tübingen
  • , Marc van KreveldAffiliated withDepartment of Computer Science, Utrecht University
  • , Bettina SpeckmannAffiliated withDepartment of Mathematics and Computer Science, TU Eindhoven


We introduce the concept of subdivision drawings of hypergraphs. In a subdivision drawing each vertex corresponds uniquely to a face of a planar subdivision and, for each hyperedge, the union of the faces corresponding to the vertices incident to that hyperedge is connected. Vertex-based Venn diagrams and concrete Euler diagrams are both subdivision drawings. In this paper we study two new types of subdivision drawings which are more general than concrete Euler diagrams and more restricted than vertex-based Venn diagrams. They allow us to draw more hypergraphs than the former while having better aesthetic properties than the latter.