Drawing Hypergraphs in the Subset Standard (Short Demo Paper)

Authors:
François Bertault;Peter Eades
Affiliations:
-;-
Venue:
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Year:
2000

Citing 5
Cited 4

On visual formalisms

Communications of the ACM
Graph drawing by force-directed placement

Software—Practice & Experience
LEDA: a platform for combinatorial and geometric computing

Communications of the ACM
A programming project: trimming the spring algorithm for drawing hypergraphs

ACM SIGCSE Bulletin
A force-directed algorithm that preserves edge-crossing properties

Information Processing Letters - Special issue analytical theory of fuzzy control with applications

Generating Euler Diagrams

DIAGRAMS '02 Proceedings of the Second International Conference on Diagrammatic Representation and Inference
Subdivision Drawings of Hypergraphs

Graph Drawing
Kelp Diagrams: Point Set Membership Visualization

Computer Graphics Forum
Visual analysis of set relations in a graph

EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.