An Heuristic for the Construction of Intersection Graphs

Paolo Simonetto (1, 2) , David Auber (1, 2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 GRAVITE - Graph Visualization and Interactive Exploration

Most methods for generating Euler diagrams describe the detection of the general structure of the final drawing as the first step. This information is generally encoded using a graph, where nodes are the regions to be represented and edges represent adjacency. A planar drawing of this graph will then indicate how to draw the sets in order to depict all the set intersections. In this paper we present an heuristic to construct this structure, the intersection graph. The final Euler diagram can be constructed by drawing the sets boundaries around the nodes of the intersection graph, either manually or automatically.

Mots clés: Euler diagrams; overlapping clustering

Domaines: Autre [cs.OH]

Paolo Simonetto, David Auber. An Heuristic for the Construction of Intersection Graphs. 13th International Conference on Information Visualisation (IV09), Jul 2009, Barcelona, Spain. pp.673-678. ⟨hal-00407218⟩