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.