Drawing Area-Proportional Euler Diagrams Representing Up To Three Sets

Area-proportional Euler diagrams representing three sets are commonly used to visualize the results of medical experiments, business data, and information from other applications where statistical results are best shown using interlinking curves. Currently, there is no tool that will reliably visualize exact area-proportional diagrams for up to three sets. Limited success, in terms of diagram accuracy, has been achieved for a small number of cases, such as Venn-2 and Venn-3 where all intersections between the sets must be represented. Euler diagrams do not have to include all intersections and so permit the visualization of cases where some intersections have a zero value. This paper describes a general, implemented, method for visualizing all 40 Euler-3 diagrams in an area-proportional manner. We provide techniques for generating the curves with circles and convex polygons, analyze the drawability of data with these shapes, and give a mechanism for deciding whether such data can be drawn with circles. For the cases where non-convex curves are necessary, our method draws an appropriate diagram using non-convex polygons. Thus, we are now always able to automatically visualize data for up to three sets

Some Results for Drawing Area Proportional Venn3 With Convex Curves

Many data sets are visualized effectively with area proportional Venn diagrams, where the area of the regions is in proportion to a defined specification. In particular, Venn diagrams with three intersecting curves are considered useful for visualizing data in many applications, including bioscience, ecology and medicine. To ease the understanding of such diagrams, using restricted nice shapes for the curves is considered beneficial. Many research questions on the use of such diagrams are still open. For instance, a general solution to the question of when given area specifications can be represented by Venn3 using convex curves is still unknown. In this paper we study symmetric Venn3 drawn with convex curves and show that there is a symmetric area specification that cannot be represented with such a diagram. In addition, by using symmetric diagrams drawn with polygons, we show that, if area specifications are restricted so that the double intersection areas are no greater than the triple intersection area then the specification can be drawn with convex curves. We also propose a construction that allows the representation of some area specifications when the double intersection areas are greater than the triple intersection area. Finally, we present some open questions on the topic

VennDiagramWeb: a web application for the generation of highly customizable Venn and Euler diagrams.

BackgroundVisualization of data generated by high-throughput, high-dimensionality experiments is rapidly becoming a rate-limiting step in computational biology. There is an ongoing need to quickly develop high-quality visualizations that can be easily customized or incorporated into automated pipelines. This often requires an interface for manual plot modification, rapid cycles of tweaking visualization parameters, and the generation of graphics code. To facilitate this process for the generation of highly-customizable, high-resolution Venn and Euler diagrams, we introduce VennDiagramWeb: a web application for the widely used VennDiagram R package. VennDiagramWeb is hosted at http://venndiagram.res.oicr.on.ca/ .ResultsVennDiagramWeb allows real-time modification of Venn and Euler diagrams, with parameter setting through a web interface and immediate visualization of results. It allows customization of essentially all aspects of figures, but also supports integration into computational pipelines via download of R code. Users can upload data and download figures in a range of formats, and there is exhaustive support documentation.ConclusionsVennDiagramWeb allows the easy creation of Venn and Euler diagrams for computational biologists, and indeed many other fields. Its ability to support real-time graphics changes that are linked to downloadable code that can be integrated into automated pipelines will greatly facilitate the improved visualization of complex datasets. For application support please contact [email protected]

Optimal Bounds for the kk-cut Problem

In the $k$-cut problem, we want to find the smallest set of edges whose deletion breaks a given (multi)graph into $k$ connected components. Algorithms of Karger & Stein and Thorup showed how to find such a minimum $k$-cut in time approximately $O(n^{2k})$. The best lower bounds come from conjectures about the solvability of the $k$-clique problem, and show that solving $k$-cut is likely to require time $\Omega(n^k)$. Recent results of Gupta, Lee & Li have given special-purpose algorithms that solve the problem in time $n^{1.98k + O(1)}$, and ones that have better performance for special classes of graphs (e.g., for small integer weights). In this work, we resolve the problem for general graphs, by showing that the Contraction Algorithm of Karger outputs any fixed $k$-cut of weight $\alpha \lambda_k$ with probability $\Omega_k(n^{-\alpha k})$, where $\lambda_k$ denotes the minimum $k$-cut size. This also gives an extremal bound of $O_k(n^k)$ on the number of minimum $k$-cuts and an algorithm to compute a minimum $k$-cut in similar runtime. Both are tight up to lower-order factors, with the algorithmic lower bound assuming hardness of max-weight $k$-clique. The first main ingredient in our result is a fine-grained analysis of how the graph shrinks -- and how the average degree evolves -- in the Karger process. The second ingredient is an extremal bound on the number of cuts of size less than $2 \lambda_k/k$, using the Sunflower lemma.Comment: Final version of arXiv:1911.09165 with new and more general proof

Two Squares of Opposition: for Analytic and Synthetic Propositions

In the paper I prove that there are two squares of opposition. The unconventional one is built up for synthetic propositions. There a, i are contrary, a, o (resp. e, i) are contradictory, e, o are subcontrary, a, e (resp. i, o) are said to stand in the subalternation

A Normal Form for Spider Diagrams of Order

We develop a reasoning system for an Euler diagram based visual logic, called spider diagrams of order. We de- fine a normal form for spider diagrams of order and provide an algorithm, based on the reasoning system, for producing diagrams in our normal form. Normal forms for visual log- ics have been shown to assist in proving completeness of associated reasoning systems. We wish to use the reasoning system to allow future direct comparison of spider diagrams of order and linear temporal logic