Drawing Hypergraphs in the Subset Standard (Short Demo Paper)

  • François Bertault
  • Peter Eades
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1984)


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.


  1. 1.
    F. Bertault. A force-directed algorithm that preserves edge-crossing properties. Information Processing Letters, 74(1–2):7–13, 2000.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129–1164, 1991.CrossRefGoogle Scholar
  3. 3.
    D. Harel. On visual formalisms. Communications of the ACM, 31(5):514–530, 1988.CrossRefMathSciNetGoogle Scholar
  4. 4.
    D. S. Johnson and H. O. Pollak. Hypergraph planarity and the complexity of drawing venn diagrams. Journal of Graph Theory, 1987.Google Scholar
  5. 5.
    R. M. Karp. On the computational complexity of combinatorial problems. Networks, 5:45–68, 1975.MATHMathSciNetGoogle Scholar
  6. 6.
    H. Klemetti, I. Lapinleimu, E. Mäkinen, and M. Sieranta. A programming project: Trimming the spring algorithm for drawing hypergraphs. SIGCSE Bulletin, 27(3):34–38, 1995.CrossRefGoogle Scholar
  7. 7.
    E. Mäkinen. How to draw a hypergraph. International Journal of Computer Mathematics, 1990.Google Scholar
  8. 8.
    K. Mehlhorn and S. Naher. LEDA, a Platform for Combinatorial and Geometric Computing. Communications of the ACM, 38(1):96–102, 1995.CrossRefGoogle Scholar
  9. 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
  10. 10.
    P. Winter and M. Zachariasen. Euclidean steiner minimum trees: An improved exact algorithm. Networks, 30:149–166, 1997.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • François Bertault
    • 1
  • Peter Eades
    • 2
  1. 1.The University of SydneyAustralia
  2. 2.Tom Sawyer SoftwareBerkeleyUSA

Personalised recommendations