The Community for Technology Leaders
Green Image
Issue No. 06 - November/December (2010 vol. 16)
ISSN: 1077-2626
pp: 1090-1099
Nathalie Henry Riche , Microsoft Research
Tim Dwyer , Microsoft Corporation Microsoft Corporation
In many common data analysis scenarios the data elements are logically grouped into sets. Venn and Euler style diagrams are a common visual representation of such set membership where the data elements are represented by labels or glyphs and sets are indicated by boundaries surrounding their members. Generating such diagrams automatically such that set regions do not intersect unless the corresponding sets have a non-empty intersection is a difficult problem. Further, it may be impossible in some cases if regions are required to be continuous and convex. Several approaches exist to draw such set regions using more complex shapes, however, the resulting diagrams can be difficult to interpret. In this paper we present two novel approaches for simplifying a complex collection of intersecting sets into a strict hierarchy that can be more easily automatically arranged and drawn (Figure 1). In the first approach, we use compact rectangular shapes for drawing each set, attempting to improve the readability of the set intersections. In the second approach, we avoid drawing intersecting set regions by duplicating elements belonging to multiple sets. We compared both of our techniques to the traditional non-convex region technique using five readability tasks. Our results show that the compact rectangular shapes technique was often preferred by experimental subjects even though the use of duplications dramatically improves the accuracy and performance time for most of our tasks. In addition to general set representation our techniques are also applicable to visualization of networks with intersecting clusters of nodes
Information Visualization, Euler diagrams, Set Visualization, Graph Visualization.

T. Dwyer and N. H. Riche, "Untangling Euler Diagrams," in IEEE Transactions on Visualization & Computer Graphics, vol. 16, no. , pp. 1090-1099, 2010.
86 ms
(Ver 3.3 (11022016))