Can I automatically generate a Venn diagram from a hold graph

Question

Let's say I have a directed graph G, where each node represents some set that I have. There exists an edge from u to v if u is a subset of v. This graph is transitive and acyclic. There are a number of source nodes (those that do not contain any of the other nodes), and one receiver (a large "reverse" set containing the union of all the others.). In other words, this graph is a transitive orientation of the mapping graph .

What I want to know, can I automatically create a beautiful Euler diagram from this graph?

An Euler diagram is similar to a Venn diagram, but you do not need to show each combination of overlap between sets.

An example is something like this (taken from Wikipedia):

I'm sure I could make diagrams like this, but I am dealing with large data sets that I will constantly add, so I would like to automate the process. Please note that the relative size of the diagrams is not important for me, only if the two areas intersect, are mutually exclusive, or if they are contained in another.

Are there algorithms, tools, or libraries that let me do this?

Please note that I asked a similar question here , but most of my answers were that LaTeX was just not suitable for this work, So I ask about it here.

Answer 1

"Euler diagrams are difficult to draw automatically, and the goal of this project is to create the first method for drawing all Euler diagrams." - from eulerdiagrams.com , but there are a few links.

In addition, a search for the Euler diagram generation seems to produce some results, such as Vennerable . But judging by this article of 2008, it is still a fairly active area of ​​research.

Answer 2

You can find your solution here: SageMath . This is a very powerful Math engine that allows you to draw many diagrams.