Drawing Venn Triangles

Carroll, Jeremy J.

HPL-2000-73

Keyword(s): venn diagram; triangles; corners

Abstract: We use a straight-line graph-drawing algorithm to draw overlapping triangles. The graphs and extended co- linearity constraints are chosen to be graphs of 6- Venn diagrams, using a graph theoretic brute-force search. A method for identifying the corners in a family of intersecting simple closed curves is described. Hence Grunbaum's problem of drawing a Venn diagram of six triangles is solved. Two of the 126 distinct solutions are presented.

10 Pages

Back to Index