Drawing Venn Triangles

Carroll, Jeremy J.

HP Development Company

关键词: venn diagram;    triangles;    corners;   

RP-ID  :  HPL-2000-73

学科分类：计算机科学（综合）

美国|英语

来源: HP Labs

【 摘 要 】

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.