21 research outputs found
Does the Orientation of an Euler Diagram Affect User Comprehension?
Euler diagrams, which form the basis of numerous visual languages, can be an effective representation of information when they are both well-matched and well-formed. However, being well-matched and well-formed alone does not imply effectiveness. Other diagrammatical properties need to be considered. Information visualization theorists have known for some time that orientation has the potential to affect our interpretation of diagrams. This paper begins by explaining why well-matched and well-formed drawing principles are insufficient and discusses why we should study the orientation of Euler diagrams. To this end an empirical study is presented, designed to observe the effect of orientation upon the comprehension of Euler diagrams. The paper concludes that the orientation of Euler diagrams does not significantly affect comprehension
On the Completeness of Spider Diagrams Augmented with Constants
Diagrammatic reasoning can be described formally by a number of diagrammatic logics; spider diagrams are one of these, and are used for expressing logical statements about set membership and containment. Here, existing work on spider diagrams is extended to include constant spiders that represent specific individuals. We give a formal syntax and semantics for the extended diagram language before introducing a collection of reasoning rules encapsulating logical equivalence and logical consequence. We prove that the resulting logic is sound, complete and decidable
Euler Diagram Transformations
Euler diagrams are a visual language which are used for purposes such as the presentation of set-based data or as the basis of visual logical languages which can be utilised for software specification and reasoning. Such Euler diagram reasoning systems tend to be defined at an abstract level, and the concrete level is simply a visualisation of an abstract model, thereby capturing some subset of the usual boolean logic. The visualisation process tends to be divorced from the data transformation process thereby affecting the user's mental map and reducing the effectiveness of the diagrammatic notation. Furthermore, geometric and topological constraints, called wellformedness conditions, are often placed on the concrete diagrams to try to reduce human comprehension errors, and the effects of these conditions are not modelled in these systems.
We view Euler diagrams as a type of graph, where the faces that are present are the key features that convey information and we provide transformations at the dual graph level that correspond to transformations of Euler diagrams, both in terms of editing moves and logical reasoning moves. This original approach gives a correspondence between manipulations of diagrams at an abstract level (such as logical reasoning steps, or simply an update of information) and the manipulation at a concrete level. Thus we facilitate the presentation of diagram changes in a manner that preserves the mental map. The approach will facilitate the realisation of reasoning systems at the concrete level; this has the potential to provide diagrammatic reasoning systems that are inherently different from symbolic logics due to natural geometric constraints. We provide a particular concrete transformation system which
preserves the important criteria of planarity and connectivity, which may form part of a framework encompassing multiple concrete systems each adhering to different sets of wellformedness conditions
EulerMerge: Simplifying Euler Diagrams Through Set Merges
Euler diagrams are an intuitive and popular method to visualize set-based
data. In a Euler diagram, each set is represented as a closed curve, and set
intersections are shown by curve overlaps. However, Euler diagrams are not
visually scalable and automatic layout techniques struggle to display
real-world data sets in a comprehensible way. Prior state-of-the-art approaches
can embed Euler diagrams by splitting a closed curve into multiple curves so
that a set is represented by multiple disconnected enclosed areas. In addition,
these methods typically result in multiple curve segments being drawn
concurrently. Both of these features significantly impede understanding. In
this paper, we present a new and scalable method for embedding Euler diagrams
using set merges. Our approach simplifies the underlying data to ensure that
each set is represented by a single, connected enclosed area and that the
diagram is drawn without curve concurrency, leading to well formed and
understandable Euler diagrams
Drawing place field diagrams of neural codes using toric ideals
A neural code is a collection of codewords (0-1 vectors) of a given length n; it captures the co-firing patterns of a set of neurons. A neural code is convexly realizable in dimension two if there exist n convex sets in the plane so that each codeword in the code corresponds to a unique intersection carved out by the convex sets. There are some methods to determine whether a neural code is convexly realizable; however, these methods do not describe how to draw a realization, that is, a place field diagram of the code. In this work, we construct toric ideals from neural codes, and we show how we can use these ideals, along with the theory of inductive piercings and Euler diagrams, to draw realizations for particular classes of codes
An Heuristic for the Construction of Intersection Graphs
International audienceMost 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
MetroSets: Visualizing Sets as Metro Maps
We propose MetroSets, a new, flexible online tool for visualizing set systems
using the metro map metaphor. We model a given set system as a hypergraph
, consisting of a set of vertices and a set
, which contains subsets of called hyperedges. Our system then
computes a metro map representation of , where each hyperedge
in corresponds to a metro line and each vertex corresponds to a
metro station. Vertices that appear in two or more hyperedges are drawn as
interchanges in the metro map, connecting the different sets. MetroSets is
based on a modular 4-step pipeline which constructs and optimizes a path-based
hypergraph support, which is then drawn and schematized using metro map layout
algorithms. We propose and implement multiple algorithms for each step of the
MetroSet pipeline and provide a functional prototype with \new{easy-to-use
preset configurations.} % many real-world datasets. Furthermore, \new{using
several real-world datasets}, we perform an extensive quantitative evaluation
of the impact of different pipeline stages on desirable properties of the
generated maps, such as octolinearity, monotonicity, and edge uniformity.Comment: 19 pages; accepted for IEEE INFOVIS 2020; for associated live system,
see http://metrosets.ac.tuwien.ac.a