Drawing Hypergraphs in the Subset Standard (Short Demo Paper)

  • François Bertault
  • Peter Eades
Conference paper

DOI: 10.1007/3-540-44541-2_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1984)
Cite this paper as:
Bertault F., Eades P. (2001) Drawing Hypergraphs in the Subset Standard (Short Demo Paper). In: Marks J. (eds) Graph Drawing. GD 2000. Lecture Notes in Computer Science, vol 1984. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

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