Subdivision Drawings of Hypergraphs

Authors:
Michael Kaufmann;Marc Kreveld;Bettina Speckmann
Affiliations:
Institut für Informatik, Universität Tübingen,;Department of Computer Science, Utrecht University,;Department of Mathematics and Computer Science, TU Eindhoven,
Venue:
Graph Drawing
Year:
2009

Citing 7
Cited 6

Realizability of Delaunay triangulations

Information Processing Letters
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
Degrees of acyclicity for hypergraphs and relational database schemes

Journal of the ACM (JACM)
Generating Euler Diagrams

DIAGRAMS '02 Proceedings of the Second International Conference on Diagrammatic Representation and Inference
Drawing Hypergraphs in the Subset Standard (Short Demo Paper)

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Graphs and Hypergraphs

Graphs and Hypergraphs
Communities in graphs and hypergraphs

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management

Path-based supports for hypergraphs

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Blocks of hypergraphs: applied to hypergraphs and outerplanarity

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
On planar supports for hypergraphs

GD'09 Proceedings of the 17th international conference on Graph Drawing
Path-based supports for hypergraphs

Journal of Discrete Algorithms
Modeling higher-order term dependencies in information retrieval using query hypergraphs

SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Visual analysis of set relations in a graph

EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

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.