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


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

Download full-text


Available from: Gennaro Cordasco
  • Source
    • "Hence, it improves on existing work that was limited to so-called well-formed Euler diagrams which do not allow any of these properties to be present [2]. The algorithm in [2], as with our algorithm, has a time complexity that is exponential in the number of curves. This is because the running time of both is dependent on the number of zones, and the maximum number of zones for a set of curves, C, is 2 |C| . "
    [Show abstract] [Hide abstract]
    ABSTRACT: Euler diagrams form the basis of various visual languages but tool support for creating them is generally limited to generic diagram editing software using mouse and keyboard interaction. A more natural and convenient mode of entry is via a sketching interface which facilitates greater cognitive focus on the task of diagram creation. Previous work has developed sketching interfaces for Euler diagrams drawn with ellipses. This paper presents SketchSet, the first sketch tool for Euler diagrams whose curves can be circles, ellipses, or arbitrary shapes. SketchSet allows the creation of formal diagrams via point and click interaction. The user drawn diagram, in sketched or formal format, is automatically converted to a diagram in the other format, thus maintaining both views. We provide a mechanism that allows semantic differences between the sketch and the formal diagram to be rectified automatically. Finally, we present a user study that evaluates the effectiveness of the tool.
    Full-text · Conference Paper · Sep 2011
  • Source
    • "We introduce in [6] the new concept of marked Euler Diagrams, which are Euler diagrams together with a distinguished set of points which mark the zones of the diagram. This enables the tracking of the zone set via this set of marked points and is a fundamental concept utilised in our zone computation algorithm. "
    [Show abstract] [Hide abstract]
    ABSTRACT: The Silences of the Archives, the Reknown of the Story. The Martin Guerre affair has been told many times since Jean de Coras and Guillaume Lesueur published their stories in 1561. It is in many ways a perfect intrigue with uncanny resemblance, persuasive deception and a surprizing end when the two Martin stood face to face, memory to memory, before captivated judges and a guilty feeling Bertrande de Rols. The historian wanted to go beyond the known story in order to discover the world of the heroes. This research led to disappointments and surprizes as documents were discovered concerning the environment of Artigat’s inhabitants and bearing directly on the main characters thanks to notarial contracts. Along the way, study of the works of Coras and Lesueur took a new direction. Coming back to the affair a quarter century later did not result in finding new documents (some are perhaps still buried in Spanish archives), but by going back over her tracks, the historian could only be struck by the silences of the archives that refuse to reveal their secrets and, at the same time, by the possible openings they suggest, by the intuition that almost invisible threads link here and there characters and events.
    Full-text · Article · Jan 2011 · Computational Geometry
  • [Show abstract] [Hide abstract]
    ABSTRACT: The use of diagrammatic logic as a reasoning mechanism to produce inferences on subsets of some universe could provide a way to overcome the current limitations of visual modelling methods, which have to be integrated with textual languages to express complex constraints. On the other hand, graph transformations are becoming widespread as a way to express formal semantics for visual modelling languages, so that a mechanisation of diagrammatic logic based on graph transformation would facilitate language integration, based on a common underlying machinery. In this paper, we propose such a mechanisation for spider diagrams (SDs), an established language for reasoning with diagrams modelling relations between sets and constraints on their cardinalities. The concrete syntax of SDs extends that of Euler diagrams that use closed curves and the enclosed regions to represent sets and their intersections. The language is augmented with reasoning rules, i.e. syntactic transformation rules corresponding to logical inference rules. However, these rules are typically defined in procedural terms, so that a completely formal specification and an adequate mechanisation of them has not been achieved yet. We propose an abstract syntax for SDs in terms of typed graphs and define the corresponding language of Spider Graphs (SGs), expressing reasoning rules for SDs as graph transformation units. This enables a direct realisation of the reasoning system via graph transformation tools without resorting to ad hoc implementations, and we provide an implementation in AGG. Techniques for static analysis become available to reason on proof strategies and on possible optimisations.
    No preview · Article · Jan 2010 · Software and Systems Modeling
Show more