论文信息 - Drawing Hypergraphs in the Subset Standard (Short Demo Paper)

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.

Peter Eades | François Bertault | P. Eades | François Bertault

[1] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[2] William L. Ditto,et al. Principles and applications of chaotic systems , 1995, CACM.

[3] J. Venn,et al. . On the diagrammatic and mechanical representation of propositions and reasonings , 2022 .

[4] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[5] Sydney Young,et al. I. On the boiling-points of homologous compounds , 1905 .

[6] François Bertault,et al. A force-directed algorithm that preserves edge-crossing properties , 1999, Inf. Process. Lett..

[7] David S. Johnson,et al. Hypergraph planarity and the complexity of drawing venn diagrams , 1987, J. Graph Theory.

[8] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[9] Martin Zachariasen,et al. Euclidean Steiner minimum trees: An improved exact algorithm , 1997 .

[10] David Harel,et al. On visual formalisms , 1988, CACM.

[11] Harri Klemetti,et al. A programming project: trimming the spring algorithm for drawing hypergraphs , 1995, SGCS.

[12] Erkki Mäkinen,et al. How to draw a hypergraph , 1990, Int. J. Comput. Math..