#### Filter Results:

#### Publication Year

2004

2013

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A Venn diagram is simple if at most two curves intersect at any given point. A recent paper of Griggs, Killian, and Savage [Elec. J. Combinatorics, Research Paper 2, 2004] shows how to construct rotationally symmetric Venn diagrams for any prime number of curves. However, the resulting diagrams contain only n n/2 intersection points, whereas a simple Venn… (More)

In this paper we give a construction, for any n, of an n-Venn diagram on the sphere that has antipodal symmetry; that is, the diagram is fixed by the map that takes a point on the sphere to the corresponding antipodal point. Thus, along with certain diagrams due to Anthony Edwards which can be drawn with rotational and reflective symmetry, for any isometry… (More)

We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Speciically, for any n-Venn diagram of convex k-gons, we prove that k (2 n 2 n)=(n(n 2)). In the process we prove that Venn diagrams of seven curves, simple or not, cannot be formed from triangles. We then give an example… (More)

<i>Water Columns</i> consists of three extremely lightweight, passively actuated kinetic sculptures that take advantage of the relative tendency of wood to absorb moisture from the atmosphere to create passive engines for actuation of a long array of bi-laminate filaments. The sculptures change shape over the course of the day as relative humidity rises and… (More)

The Tampa to Anaheim Hackshack workshop is designed for dogged tinkerers of all descriptions and levels of skill. Be your motives moral, ethical, frivolous, or just plain senseless, the Tampa to Anaheim Hackshack workshop provides the means and expertise to implement a large host of Ad-Hoc solutions to the issues of everyday life. Projects to be built by… (More)

Many researchers have had fun searching for and rendering symmetric Venn diagrams , culminating in the recent result of Griggs, Killian and Savage (Electronic Journal of Combinatorics, " Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice " , 11 (2004) R2 [3]), that symmetric Venn diagrams on n curves exist if and only if n is prime. Our… (More)

- ‹
- 1
- ›