A survey of Euler diagrams

Rodgers, Peter

doi:10.1016/j.jvlc.2013.08.006

Cited by 53 publications

(37 citation statements)

References 93 publications

(115 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Considerable efforts have been made to produce algorithms for size-proportional Euler diagrams [29, 25], as also demonstrated by a survey on Euler diagrams [24]. Yet, if the task is to judge the cardinalities of intersections, Euler and Venn diagrams are not a good choice, since they use area to encode quantitative values, which is shown to be inferior to, e.g., position [17, 13].…”

Section: Related Workmentioning

confidence: 99%

UpSet: Visualization of Intersecting Sets

Lex

Gehlenborg

Strobelt

et al. 2014

IEEE Trans. Visual. Comput. Graphics

1,728

1,307

View full text Add to dashboard Cite

Understanding relationships between sets is an important analysis task that has received widespread attention in the visualization community. The major challenge in this context is the combinatorial explosion of the number of set intersections if the number of sets exceeds a trivial threshold. In this paper we introduce UpSet, a novel visualization technique for the quantitative analysis of sets, their intersections, and aggregates of intersections. UpSet is focused on creating task-driven aggregates, communicating the size and properties of aggregates and intersections, and a duality between the visualization of the elements in a dataset and their set membership. UpSet visualizes set intersections in a matrix layout and introduces aggregates based on groupings and queries. The matrix layout enables the effective representation of associated data, such as the number of elements in the aggregates and intersections, as well as additional summary statistics derived from subset or element attributes. Sorting according to various measures enables a task-driven analysis of relevant intersections and aggregates. The elements represented in the sets and their associated attributes are visualized in a separate view. Queries based on containment in specific intersections, aggregates or driven by attribute filters are propagated between both views. We also introduce several advanced visual encodings and interaction methods to overcome the problems of varying scales and to address scalability. UpSet is web-based and open source. We demonstrate its general utility in multiple use cases from various domains.

show abstract

Section: Related Workmentioning

confidence: 99%

UpSet: Visualization of Intersecting Sets

Lex

Gehlenborg

Strobelt

et al. 2014

IEEE Trans. Visual. Comput. Graphics

1,728

1,307

View full text Add to dashboard Cite

show abstract

“…An individual set is typically bounded by a closed curve called a contour , and an intersection among multiple sets is represented by their overlap. Various techniques have been developed to automate the layout design and color assignment of Euler diagrams [Rod14, SA08, RD10]. However, conventional techniques for drawing Euler diagrams and their variants are limited to static cases, and thus they fail to directly convey details about the dynamic transitions of sets.…”

Section: Related Workmentioning

confidence: 99%

Optimizing Stepwise Animation in Dynamic Set Diagrams

Mizuno¹,

Takahashi

et al. 2019

Computer Graphics Forum

View full text Add to dashboard Cite

A set diagram represents the membership relation among data elements. It is often visualized as secondary information on top of primary information, such as the spatial positions of elements on maps and charts. Visualizing the temporal evolution of such set diagrams as well as their primary features is quite important; however, conventional approaches have only focused on the temporal behavior of the primary features and do not provide an effective means to highlight notable transitions within the set relationships. This paper presents an approach for generating a stepwise animation between set diagrams by decomposing the entire transition into atomic changes associated with individual data elements. The key idea behind our approach is to optimize the ordering of the atomic changes such that the synthesized animation minimizes unwanted set occlusions by considering their depth ordering and reduces the gaze shift between two consecutive stepwise changes. Experimental results and a user study demonstrate that the proposed approach effectively facilitates the visual identification of the detailed transitions inherent in dynamic set diagrams.

show abstract

“…Actually realising the drawing in an aesthetic way is a further challenge. Both of these problems have seen a lot of interest from computer-scientists and mathematicians and sophisticated algorithms have been developed [43,46]. Here, we have defined the layout for rectangular boxes with a relatively simple declarative model, and left both the problems of determining feasibility and (if possible) layout to the solver.…”

Section: Ultra-compact Grid Layoutmentioning

confidence: 99%

High-Quality Ultra-Compact Grid Layout of Grouped Networks

Yoghourdjian

Dwyer

Gange

et al. 2016

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Fig. 1: Grid systems in typographic layout, UI design and an example of our proposed grid layout for a power-graph. With graphic designers playing an increasing role in the design of user interfaces for phone, tablet and desktop operating systems, this traditional grid-based design aesthetic is becoming more popular in these media. A case in point is Microsoft's "Modern" interface which seeks to unify app-design across devices. This resurgence of the grid-design aesthetic in new media leads us to re-examine some of the aesthetic assumptions that have been made in designing layout methods for network diagrams.Abstract-Prior research into network layout has focused on fast heuristic techniques for layout of large networks, or complex multi-stage pipelines for higher quality layout of small graphs. Improvements to these pipeline techniques, especially for orthogonal-style layout, are difficult and practical results have been slight in recent years. Yet, as discussed in this paper, there remain significant issues in the quality of the layouts produced by these techniques, even for quite small networks. This is especially true when layout with additional grouping constraints is required. The first contribution of this paper is to investigate an ultra-compact, grid-like network layout aesthetic that is motivated by the grid arrangements that are used almost universally by designers in typographical layout. Since the time when these heuristic and pipeline-based graph-layout methods were conceived, generic technologies (MIP, CP and SAT) for solving combinatorial and mixed-integer optimization problems have improved massively. The second contribution of this paper is to reassess whether these techniques can be used for high-quality layout of small graphs. While they are fast enough for graphs of up to 50 nodes we found these methods do not scale up. Our third contribution is a large-neighborhood search meta-heuristic approach that is scalable to larger networks.

show abstract

A survey of Euler diagrams

Cited by 53 publications

References 93 publications

UpSet: Visualization of Intersecting Sets

UpSet: Visualization of Intersecting Sets

Optimizing Stepwise Animation in Dynamic Set Diagrams

High-Quality Ultra-Compact Grid Layout of Grouped Networks

Contact Info

Product

Resources

About