hp home products & services support solutions how to buy
hp logo - invent
corner hp labs corner
search search
contact hp contact hp
hp labs home hp labs home
about hp labs about hp labs
research research
news and events news and events
careers @ labs careers @ labs
technical reports technical reports
talks and speeches talks and speeches
worldwide sites worldwide sites
corner corner
HP Labs Technical Reports

Click here for full text: PDF

Drawing Venn Triangles

Carroll, Jeremy J.


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

printing icon
printing instructions printing instructions
Privacy Statement Legal Notices © 1994-2000 Hewlett-Packard Company