The octahedron was the first balloon I ever made. It is by far the easiest one to make since all the vertices have degree 4. There are many one balloon paths that construct the octahedron but the one I describe here is nice because it does not require a balloon to be pulled through a triangle.
To describe this I have the following youTube videos.
Here's the original with a 350 balloon.
The psuedogauss code for this is
1 2 3 4 5 2 6 4 1 5 6 3 1
This blog is devoted to patterns made with polygons. I'll try to have something interesting posted regularly.
Wednesday, August 20, 2008
The Balloon Tetrahedron
The first balloon design is this 1balloon tetrahedron design. It's not the easiest design but it's the easiest shape. The tetrahedron is composed of four triangles but I like to focus on the edges and vertices (I like to think in terms of graph theory). There are six edges and four vertices. The problem with the making the tetrahedron is that the vertices have degree threethis means that every vertex has a problem (see Eulerian path). A balloon comes into a vertex and leaves the vertex which takes care of two of the three edges but the remaining one has to be dealt with. So you can either have the balloon start or end at that vertex (but each balloon only has two ends) or you could cheat. There a number of ways to cheat but the one used here is to join each balloon with an interior point. With this design, each of the vertices now has degree four.
As well as a video of the construction, I'll include a diagram and a sequences of that describes the design similar to Gauss code. This is perhaps more to introduce the method of description rather than to be useful in this case. So here I'll have a planar graph with the vertices labeled but the interior point(0) omitted (which would make it nonplanar).
0^{z}, 1, 2, 3, 1, 4, 2, 0, 4, 3, 0_{z}
The z superscript indicates that the 0 is a delayed connection until the z subscript.
As well as a video of the construction, I'll include a diagram and a sequences of that describes the design similar to Gauss code. This is perhaps more to introduce the method of description rather than to be useful in this case. So here I'll have a planar graph with the vertices labeled but the interior point(0) omitted (which would make it nonplanar).
0^{z}, 1, 2, 3, 1, 4, 2, 0, 4, 3, 0_{z}
The z superscript indicates that the 0 is a delayed connection until the z subscript.
Subscribe to:
Posts (Atom)
Popular Posts

This one was fun to make. I wanted a cool snowflake to be a backdrop for a presentation (http://prezi.com/jie04ey9bhjr/zulo/) that I wa...

Unlike normal, I was able to deliver the square version of the descending pentagons quickly. There was no math to figure out. although ...

Tileland+ interface Along with an interface update , I added a some language extras. The native Tileland instructions remain (polygon...