Conference Paper

Interactive visual classification with Euler diagrams.

DOI: 10.1109/VLHCC.2009.5295265 Conference: IEEE Symposium on Visual Languages and Human-Centric Computing, VL/HCC 2009, Corvallis, OR, USA, 20-24 September 2009, Proceedings
Source: DBLP

ABSTRACT We present the theoretical foundation, the design and the implementation
of a library, called EulerVC to interactively handle Euler diagrams
for the purposes of resource management. Fast on-line algorithms
to interpret wellformed diagrams have been developed utilising a
new notion of marked points to keep track of the zone sets. The interface
allows the construction of overlapping ellipses to represent categories
together with the drag and drop of resources in order to categorise
them. A visual indicator can be used to show if the diagram under
construction is not wellformed to assist in reducing user mistakes,
and sets of tags can be assigned to resources upon export. The generic
approach is demonstrated via an integration with the bookmarking
site del.icio.us.

0 Bookmarks
 · 
89 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The categorisation of information is a very common practice. Often, the user may need to use multiple hierarchies or require multiple characterisations to be active at the same time, or they may wish to define cross-cutting groups for special purposes. The work developed in this paper is aimed at providing a flexible, seamless management of various ways of organising the required information. The concept of a set is adopted as the fundamental notion of information organisation, and, in particular, the familiar visual representation of sets and their relationships in terms of Euler Diagrams is used. We facilitate the visualisation of sets, enabling the application of functions to items presented in regions of the diagram corresponding to set, or category, intersections. We present a system that realises this novel concept, together with rationale for the choices made in its development, as well as a simple scenario of use.
    End-User Development - Third International Symposium, IS-EUD 2011, Torre Canne (BR), Italy, June 7-10, 2011. Proceedings; 01/2011
  • Conference Paper: Euler diagram encodings
    [Show abstract] [Hide abstract]
    ABSTRACT: Euler Diagrams are a well-known visualisation of set-based relationships, used in many application areas and at the basis of more complex notations. We propose a static code for concrete Euler Diagrams, which enables efficient storage (vs. storage of concrete diagrams), and transformations preserving concrete-level structure, hence the viewer's mental map. We provide the theoretical underpinnings of the encoding, examples and deductions, and an indication of their utility. For use in an interactive setting, we provide algorithms to update the code upon curve addition and removal. Independently, we show that the code identifies minimal regions, enabling the computation of the abstract zone set.
    Proceedings of the 7th international conference on Diagrammatic Representation and Inference; 07/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Euler diagrams are an accessible and effective visualisation of data involving simple set-theoretic relationships. Sets are represented by closed curves in the plane and often have wellformedness conditions placed on them in order to enhance comprehensibility. The theoretical underpinning for tool support has usually focussed on the problem of generating an Euler diagram from an abstract model. However, the problem of efficient computation of the abstract model from the concrete diagram has not been addressed before, despite this computation being a necessity for computer interpretations of user drawn diagrams. This may be used, together with automated manipulations of the abstract model, for purposes such as semantic information presentation or diagrammatic theorem proving. Furthermore, in interactive settings, the user may update diagrams “on-line” by adding and removing curves, for example, in which case a system requirement is the update of the abstract model (without the necessity of recomputation of the entire abstract model). We define the notion of marked Euler diagrams, together with a method for associating marked points on the diagram with regions in the plane. Utilising these, we provide on-line algorithms which quickly compute the abstract model of a weakly reducible wellformed Euler diagram (constructible as a sequence of additions or removals of curves, keeping a wellformed diagram at each step), and quickly updates both the set of curves in the plane as well as the abstract model according to the on-line operations. Efficiency is demonstrated by comparison with a common, naive algorithm. Furthermore, the methodology enables a straightforward implementation which has subsequently been realised as an application for the user classification domain.
    Comput. Geom. 01/2011; 44:52-68.

Full-text (2 Sources)

View
51 Downloads
Available from
Jun 10, 2014