International Symposium on Graph Drawing

GD 2008: Graph Drawing pp 396-407

Subdivision Drawings of Hypergraphs

  • Michael Kaufmann
  • Marc van Kreveld
  • Bettina Speckmann
Conference paper

DOI: 10.1007/978-3-642-00219-9_39

Volume 5417 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Kaufmann M., van Kreveld M., Speckmann B. (2009) Subdivision Drawings of Hypergraphs. In: Tollis I.G., Patrignani M. (eds) Graph Drawing. GD 2008. Lecture Notes in Computer Science, vol 5417. Springer, Berlin, Heidelberg

Abstract

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Michael Kaufmann
    • 1
  • Marc van Kreveld
    • 2
  • Bettina Speckmann
    • 3
  1. 1.Institut für InformatikUniversität TübingenGermany
  2. 2.Department of Computer ScienceUtrecht UniversityThe Netherlands
  3. 3.Department of Mathematics and Computer ScienceTU EindhovenThe Netherlands