Drawing Hypergraphs in the Subset Standard (Short Demo Paper)
We report an experience on a practical system for drawing hypergraphs in the subset standard. The Patate system is based on the application of a classical force directed method to a dynamic graph, which is deduced, at a given iteration time, from the hypergraph structure and particular vertex locations. Different strategies to define the dynamic underlying graph are presented. We illustrate in particular the method when the graph is obtained by computing an Euclidean Steiner tree.
KeywordsSteiner Tree Venn Diagram Steiner Point Patate System Minimum Steiner Tree
- 4.D. S. Johnson and H. O. Pollak. Hypergraph planarity and the complexity of drawing venn diagrams. Journal of Graph Theory, 1987.Google Scholar
- 7.E. Mäkinen. How to draw a hypergraph. International Journal of Computer Mathematics, 1990.Google Scholar
- 9.John Venn. On the diagrammatic and mechanical representation of propositions and reasonings. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 9:1–18, 1880.Google Scholar