8 research outputs found

    Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets

    Get PDF
    This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X_1,...,X_n , n<9. These diagrams are adapted for representing sets inclusions and intersections: each set X_i and each non empty intersection of a subcollection of X_1,...,X_n is represented by a unique connected region of the plane. Starting with a description of the diagram, we define the dual graph G and reason with the properties of this graph to build a planar representation of the X_1,...,X_n. These diagrams will be used to visualize the results of a complex request on any indexed video database. In fact, such a representation allows the user to perceive simultaneously the results of his query and the relevance of the database according to the query. Venn, hypergraphes, planarité de graphe, visualisation de donnée

    Evaluating the Comprehension of Euler Diagrams

    Get PDF
    We describe an empirical investigation into layout criteria that can help with the comprehension of Euler diagrams. Euler diagrams are used to represent set inclusion in applications such as teaching set theory, database querying, software engineering, filing system organisation and bio-informatics. Research in automatically laying out Euler diagrams for use with these applications is at an early stage, and our work attempts to aid this research by informing layout designers about the importance of various Euler diagram aesthetic criteria. The three criteria under investigation were: contour jaggedness, zone area inequality and edge closeness. Subjects were asked to interpret diagrams with different combinations of levels for each of the criteria. Results for this investigation indicate that, within the parameters of the study, all three criteria are important for understanding Euler diagrams and we have a preliminary indication of the ordering of their importance

    An Heuristic for the Construction of Intersection Graphs

    Get PDF
    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

    The role of twins in computing planar supports of hypergraphs

    Full text link
    A support or realization of a hypergraph HH is a graph GG on the same vertex as HH such that for each hyperedge of HH it holds that its vertices induce a connected subgraph of GG. The NP-hard problem of finding a planar} support has applications in hypergraph drawing and network design. Previous algorithms for the problem assume that twins}---pairs of vertices that are in precisely the same hyperedges---can safely be removed from the input hypergraph. We prove that this assumption is generally wrong, yet that the number of twins necessary for a hypergraph to have a planar support only depends on its number of hyperedges. We give an explicit upper bound on the number of twins necessary for a hypergraph with mm hyperedges to have an rr-outerplanar support, which depends only on rr and mm. Since all additional twins can be safely removed, we obtain a linear-time algorithm for computing rr-outerplanar supports for hypergraphs with mm hyperedges if mm and rr are constant; in other words, the problem is fixed-parameter linear-time solvable with respect to the parameters mm and rr

    Fully Automatic Visualisation of Overlapping Sets

    Get PDF
    International audienceVisualisation of taxonomies and sets has recently become an active area of research. Many application fields now require more than a strict classification of elements into a hierarchy tree. Euler diagrams, one of the most natural ways of depicting intersecting sets, may provide a solution to these problems. In this paper, we present an approach for the automatic generation of Euler-like diagrams. This algorithm differs from previous approaches in that it has no undrawable instances of input, allowing it to be used in systems where the output is always required. We also improve the readability of Euler diagrams through the use of Bezier curves and transparent coloured textures. Our approach has been implemented using the Tulip platform. Both the source and executable program used to generate the results are freely available

    Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets

    Get PDF
    This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1 , ..., Xn , n 9. These diagrams are adapted for representing sets inclusions and intersections: each set X i and each non empty intersection of a subcollection of X1 , ..., Xn is represented by a unique connected region of the plane. Starting with an abstract description of the diagram, we define the dual graph G and reason with the properties of this graph to build a planar representation of the X1 , ..., Xn . These diagrams will be used to visualize the results of a complex request on any indexed video databases. In fact, such a representation allows the user to perceive simultaneously the results of his query and the relevance of the database according to the query

    Towards a comparative evaluation of text-based specification formalisms and diagrammatic notations

    Get PDF
    Specification plays a vital role in software engineering to facilitate the development of highly dependable software. The importance of specification in software development is to serve, amongst others, as a communication tool for stakeholders in the software project. The specification also adds to the understanding of operations, and describes the properties of a system. Various techniques may be used for specification work. Z is a formal specification language that is based on a strongly-typed fragment of Zermelo-Fraenkel set theory and first-order logic to provide for precise and unambiguous specifications. Z uses mathematical notation to build abstract data, which is necessary for a specification. The role of abstraction is to describe what the system does without prescribing how it should be done. Diagrams, on the other hand, have also been used in various areas, and in software engineering they could be used to add a visual component to software specifications. It is plausible that diagrams may also be used to reason in a semi-formal way about the properties of a specification. Many diagrammatic languages are based on contours and set theory. Examples of these languages are Euler-, Spider-, Venn- and Pierce diagrams. Euler diagrams form the foundation of most diagrams that are based on closed curves. Diagrams, on the other hand, have also been used in various areas, and in software engineering they could be used to add a visual component to software specifications. It is plausible that diagrams may also be used to reason in a semi-formal way about the properties of a specification. Many diagrammatic languages are based on contours and set theory. Examples of these languages are Euler-, Spider-, Venn- and Pierce diagrams. Euler diagrams form the foundation of most diagrams that are based on closed curves. The purpose of this research is to demonstrate the extent to which diagrams can be used to represent a Z specification. A case study is used to transform the specification modelled with Z language into a diagrammatic specification. Euler, spider, Venn and Pierce diagrams are combined for this purpose, to form one diagrammatic notation that is used to transform a Z specificationSchool of ComputingM. Sc. (Information Systems

    Contours in Visualization

    Get PDF
    This thesis studies the visualization of set collections either via or defines as the relations among contours. In the first part, dynamic Euler diagrams are used to communicate and improve semimanually the result of clustering methods which allow clusters to overlap arbitrarily. The contours of the Euler diagram are rendered as implicit surfaces called blobs in computer graphics. The interaction metaphor is the moving of items into or out of these blobs. The utility of the method is demonstrated on data arising from the analysis of gene expressions. The method works well for small datasets of up to one hundred items and few clusters. In the second part, these limitations are mitigated employing a GPU-based rendering of Euler diagrams and mixing textures and colors to resolve overlapping regions better. The GPU-based approach subdivides the screen into triangles on which it performs a contour interpolation, i.e. a fragment shader determines for each pixel which zones of an Euler diagram it belongs to. The rendering speed is thus increased to allow multiple hundred items. The method is applied to an example comparing different document clustering results. The contour tree compactly describes scalar field topology. From the viewpoint of graph drawing, it is a tree with attributes at vertices and optionally on edges. Standard tree drawing algorithms emphasize structural properties of the tree and neglect the attributes. Adapting popular graph drawing approaches to the problem of contour tree drawing it is found that they are unable to convey this information. Five aesthetic criteria for drawing contour trees are proposed and a novel algorithm for drawing contour trees in the plane that satisfies four of these criteria is presented. The implementation is fast and effective for contour tree sizes usually used in interactive systems and also produces readable pictures for larger trees. Dynamical models that explain the formation of spatial structures of RNA molecules have reached a complexity that requires novel visualization methods to analyze these model\''s validity. The fourth part of the thesis focuses on the visualization of so-called folding landscapes of a growing RNA molecule. Folding landscapes describe the energy of a molecule as a function of its spatial configuration; they are huge and high dimensional. Their most salient features are described by their so-called barrier tree -- a contour tree for discrete observation spaces. The changing folding landscapes of a growing RNA chain are visualized as an animation of the corresponding barrier tree sequence. The animation is created as an adaption of the foresight layout with tolerance algorithm for dynamic graph layout. The adaptation requires changes to the concept of supergraph and it layout. The thesis finishes with some thoughts on how these approaches can be combined and how the task the application should support can help inform the choice of visualization modality
    corecore