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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Kaufmann, M., Van Kreveld, M., & Speckmann, B. (2009). Subdivision drawings of hypergraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 396–407). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_39
Mendeley helps you to discover research relevant for your work.