Spiral Unfoldings of Convex Polyhedra

Size: px
Start display at page:

Download "Spiral Unfoldings of Convex Polyhedra"

Transcription

1 Spiral Unfoldings of Convex Polyhedra Joseph O Rourke arxiv: v2 [cs.cg] 9 Oct 205 October 20, 205 Abstract The notion of a spiral unfolding of a convex polyhedron, a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although overlap is more the rule than the exception among generic polyhedra. The structure of spiral unfoldings is described, primarily through analyzing one particular class, the polyhedra of revolution. Introduction I define a spiral σ on the surface of a convex polyhedron P as a simple (non-selfintersecting) polygonal path σ = (p, p 2,..., p m ) which includes every vertex v j of P (so it is a Hamiltonian path), and so when cut permits the surface of P to be unfolded flat into R 2. (Other requirements defining a spiral will be discussed below.) The starting point for this investigation was Figure 2, an unfolding of a spiral cut-path on a tilted cube, Figure. The cut-path σ on P unfolds to two paths ρ and λ in the plane, with the surface to the right of ρ and to the left of λ. Folding the planar layout by joining ( gluing ) ρ to λ along their equal lengths results in the cube, uniquely results by Alexandrov s theorem. Note that the external angle at the bottommost vertex (marked in Figure 2) and the topmost vertex (marked 7, because σ has 6 segments and m = 7 corners ) is 90, which is the Gaussian curvature at those cube vertices. Note also that there are 8 vertices of P along both ρ and λ, with one shared at either end. The notion of restricting unfoldings of convex polyhedra by following a Hamiltonian path along polyhedron edges was introduced by Shephard 40 years ago [She75]. Shepard noted that not every polyhedron has such a Hamiltonian edge-unfolding, because not every polyhedron -skeleton has a Hamiltonian path (e.g., the rhombic dodecahedron does not have such a path). Here we are not restricting cuts to polyhedron edges. A single Hamiltonian cut-path, not necessarily following polyhedron edges, leads to what was memorably christened as Departments of Computer Science, and Mathematics, Smith College, Northampton, MA 0063, USA. orourke@cs.smith.edu. We reserve the term vertices to refer to P s vertices, and use corners for the turns of σ.

2 7 Figure : Cube with spiral cut-path σ. Figure 2: Spiral unfolding of cube. Vertices are marked with red dots. ρ is purple; λ is green. a zipper unfolding in [LDD + 0]. Those authors posed the still-open problem of whether or not every convex polyhedron has a nonoverlapping zipper unfolding. The investigation reported here does not make an advance on this question, as spiral unfoldings are a special subclass of zipper unfoldings, and nonoverlap is rare (as we will see in Section 5). Instead we pursue these unfoldings for their intrinsic, almost aesthetic, interest. In keeping with this attitude, we reach no grand conclusions, and do not offer formal proofs of claims. For terminology and background (e.g., Alexandrov s theorem, Gaussian curvature), see [DO07]. The cube unfolding in Figure 2 suggests seeking spiral unfoldings of other convex polyhedra, seeing if they avoid overlap in the plane, i.e., if they unfold to simple (non-self-intersecting) polygons. First we add some detail to the definition of a spiral. We insist that a spiral σ satisfies these requirements:. p i+ is vertically higher or the same height as p i. Letting z i be the z- coordinate of p i, this condition is z i+ z i. Therefore, p is a bottommost vertex and p m a topmost vertex of P. 2. Each segment p i p i+ advances counterclockwise (ccw) around its band. We defer the somewhat technical definition of what constitutes a ccw advance to Section 2. below. 2 Platonic Solids All of the five Platonic solids have nonoverlapping spiral unfoldings: the tetrahedron (Figures 3 and 4), the octahedron (Figures 5 and 6), the dodecahedron (Figures 7 and 8), and the icosahedron (Figure 9 and 0). Before proceeding further, a few remarks are in order. By no means are spirals uniquely defined. First, the polyhedron may be oriented with two degrees 2

3 6 Figure 3: Tetrahedron with spiral cut path. Figure 4: Spiral unfolding of tetrahedron. Figure 5: Octahedron with spiral cut path. Figure 6: Spiral unfolding of octahedron. 3

4 34 Figure 7: cut path. Dodecahedron with spiral Figure 8: Spiral unfolding of dodecahedron. 35 Figure 9: Icosahedron with spiral cut path. Figure 0: Spiral unfolding of icosahedron. 4

5 of continuous freedom. The orientation of the dodecahedron above was carefully selected to avoid overlap: see Figure. Second, for a fixed orientation, even overlap 83 Figure : Overlapping spiral unfolding of a tilted dodecahedron. though σ must pass through every vertex in sorted vertical order, there are still an infinite number of choices for spirals. For example, one may wind around several times between each vertically adjacent pair of vertices of P ; see Figure Figure 2: Upright octahedron with densely wound spiral cut-path. Further intuition may be gained from an animation of the previously shown (Figure 9 and 0) icosahedron unfolding: see Figure Spiral Definition: Bands We return to the definition of a spiral, to make precise the sense in which the spiral must always advance ccw around the polyhedron P. Let a band be the portion of P between two horizontal (z = constant) planes, such that there is no vertex of P strictly between the planes (although vertices may lie on those planes). See Figure 4. The edges of P crossing the band provide a natural combinatorial sense of ccw. If a segment p i p i+ of σ connects two edges of a band, then it is ccw if the second edge is ccw of the first edge (recall our 5

6 Figure 3: Snapshot of animation of icosahedron rolling out its spiral (35 th out of 50 frames). convention that the spiral rises from a bottom to a top vertex). In general, and in all examples in this paper, each p i does in fact lie on an edge (or several, where they meet at a vertex). However, this is not a necessary condition: p i could lie interior to a face. If p i p i+ does not connect two band edges (e.g., both p i and p i+ might be vertices connected by an edge of P ), then the following rule is used to determine whether it represents a ccw advance. Let ρ h i be the total surface angle to the right from p i p i+ down to the horizontal plane through p i, and similarly let λ h i be the surface angle to the left. Here the superscript h indicates an angle to the horizontal plane. For p i+ the analogous angles measure up to the horizontal plane through p i+. Then p i p i+ is ccw iff (a) ρ h i < λh i, and (b) ρh i+ > λh i+ ; see Figure 5. This condition requires appropriate slant at each end of p i p i+, and ensures vertical symmetry: reversing z-coordinates of a path renders it a spiral iff the original is a spiral. Before proceeding further, we describe the implementation that produced the unfoldings displayed in this paper. 3 Implementation The spiral cut-paths illustrated were created by a particular implementation, selecting a specific σ among the infinite number of choices for a given, fixed orientation of P. We first describe the algorithm in the case when no two vertices of P lie at the same height. At any one time, the portion of σ below and up to a vertex v i of P has been constructed. P is sliced with a horizontal plane through v i, and again sliced through the next vertex in the z-direction, v i+. See Figure 6. These two planes define a vertex-free band B i. The algorithm takes a parameter w indicating how many complete times σ should wind around 6

7 λ h i+ p i+ Figure 4: A band between two horizontal planes; bottom plane shown. Both planes pass through vertices in this example. p i ρ h i Figure 5: Surface angles above and below horizontal planes through p i and p i+. Figure 6: The portion of σ between v i (9) and v i+ (5). The green polygons outline the intersection of P with parallel horizontal planes through v i and v i+. 7

8 B i before connecting to v i+. In the figure, w = 0, so the connection is as direct as possible. In this instance, v i v i+ is an edge of P and could be followed, but it is not slanting ccw (Section 2.). Therefore σ spirals across several edges of P before reaching v i+. Note that, in general, σ cannot follow a geodesic as it winds around the band, as the shape of a band would only allow that in special circumstances.. The top and bottom vertices are handled specially. Because our goal is to avoid overlap, and overlap usually occurs at these apexes when acute angles are forced, the first segment from the bottom vertex v, to v 2, is selected to make a nonacute turn to connect to v 2. This can be seen clearly in Figure, where a 90 turn is selected, and in other figures. I proved that such a nonacute turn is always possible. Of course the turn at v 2 to connect to v 3 might be highly acute, often leading to overlap (e.g., in Figure ). Because the algorithm progresses from the bottom vertex to the top without look-ahead, it is possible that the details of the connection to the top vertex are not identical to the details at the bottom vertex, even when P is symmetric. This is again evident in Figure. When P is oriented so that more than one vertex lies at a particular z- height, it is necessary, by the definition of a spiral, for σ to cycle around the slice polygon at that height until all the vertices are included, before angling off to the next vertex vertically. This is evident for the dodecahedron (Figure 7), and for all the Archimedian solid unfoldings in Section 4. 4 Archimedian All 3 of the Archimedian solids have nonoverlapping spiral unfoldings. Six unfoldings are shown in Figure 7, six more in Figure 8, and the most complex 3 th, the great rhombicosidodecahedron, is shown in Figure 9. The σ used in this last case has 452 corners; the polyhedron itself has 60 vertices. As shown in [LDD + 0], all the Platonic and Archimedian solids have Hamiltonian edge-unfoldings, and in general they can be chosen to be S-shaped, visually not unlike the spiral unfoldings above. The exception is the great rhombicosidodecahedron, whose Hamiltonian edge-unfolding leads to a rather differently shaped planar polygon. 5 Overlapping spiral unfoldings 5. Random polyhedra Despite the nonoverlapping spiral unfoldings of the Platonic and Archimedian solids, avoiding overlap is actually rare. Figure 20 shows data from polyhedra constructed as the convex hull of random points uniformly distributed on a sphere. By the time P has 25 vertices, essentially no random polyhedron, in a random orientation, lead to a nonoverlapping unfolding using the spiral cut-path generated by the algorithm discussed in the previous section. The intuition for 8

9 Truncated Tetrahedron 23 CubeOctahedron 9 Truncated Cube 64 Truncated Octahedron 65 Small RhombiCubeOctahedron 34 Great RhombiCubeOctahedron 99 Figure 7: Spiral unfoldings of six Archimedian solids. 9

10 Snub Cube 45 IcosiDodecahedron 48 Truncated Dodecahedron 30 Truncated Icosahedron 99 Small RhombiIcosiDodecahedron 36 SnubDodecahedron 207 Figure 8: Spiral unfoldings of six more Archimedian solids 0

11 Figure 9: Great RhombIcosiDodecahedron Percent overlap for random polyhedra % overlap n (#verts) Figure 20: The percentage of overlapping spiral unfoldings for random polyhedron with n vertices. Each point plotted is the mean of 50 random trials.

12 why overlap is common can be seen in the nonoverlapping spiral unfolding of the 60-vertex great rhombicosidodecahedron in Figure 9: with many vertices, the spiral turns many times near the apex, and those must unfold to a precisely nested, tightly wound spiral in the plane to avoid overlap. Of course, this random data just suggests that overlap is common, not that it cannot be avoided. 5.2 Polyhedra without nonoverlapping spiral unfoldings Despite the rarity of nonoverlapping spiral unfoldings, it is not straightforward to identify a particular polyhedron P that has no nonoverlapping spiral unfolding, for two reasons: () For a given orientation of P, there are an infinite number of spirals compatible with that orientation. (2) All orientations must be blocked. Here I propose a P which almost certainly has no spiral unfolding, but my argument for this falls short of a formal proof. Define a hemiball H as the convex hull of a circle and a semicircle of equal radii, as illustrated in Figure 2. Here the full (red) circle C lies in the xyplane, and the (green) semicircle C + lies in the xz-plane. Let n be the number of points equally spaced around C, with n/2 around C +. Figure 22 shows the convex hull H n. The lateral hull edges ab connect a(θ) on C and b(θ) on C +, where Figure 2: HemiBall rims. Figure 22: HemiBall H n, n = 32. a(θ) = (cos θ, sin θ, 0), () b(θ) = (cos θ, 0, sin θ ). (2) Conjecture For sufficiently large n, the hemiball H n has no nonoverlapping spiral unfoldings. I now present evidence for this conjecture, for H = H 6. There are two special orientations of H. The first is when the flat base is horizontal; see Figure 23. Then spiral unfoldings overlap near the top of H, as in Figure 24. This illustrates the logic of H: planes slicing through the rims cut highly non-circular bands, which tend to lead to acute angles and overlapping unfoldings. 2

13 67 Figure 23: H oriented with (0, 0, ) vertical. Figure 24: Overlapping unfolding. A second special orientation, tilting H 90, is shown in Figure 25, which leads to overlap at both ends: Figure 26. For other orientations of H, either the top or the bottom (or both) plane slices cut H in eccentric bands, which result in overlaps. A typical example is shown in Figure 27. I have verified overlap occurs in hundreds of random orientations of H, which of course only implies that overlap is common, not necessary. I suggest a proof of necessity might be formulated around the following approach. Figure 28 illustrates the normal vectors to H in its standard position. Now consider orienting H so that v is normal to the horizontal slicing planes. We need only consider v in the northern hemisphere of the figure. If v lies within the 90 wedge containing the northpole, then these nearly horizontal slicing planes will cut the upper rim C + in a manner similar to that seen in Figure 23. In particular, the top vertex will be unique. If v lies outside of that wedge, then the nearly vertical slicing planes will cut the rim C, and the bottom vertex will be unique. In either case, a rim is sliced at one end or the other, and such slices will be elongated by design, leading to overlapping unfoldings. I believe this argument could be formalized. Incidentally, it is easy to find a nonoverlapping unzipping of the hemiball: see Figure 29. Another candidate for a polyhedron with no nonoverlapping spiral unfoldings is a distorted dodecahedron, distorted so that no two pentagonal faces are parallel. A flat doubly covered regular polygon with large n has just one orientation whose spirals avoid overlap: that with the disk horizontal, in which case 3

14 48 Figure 25: vertical. H oriented so (, 0, 0) is Figure 26: Overlapping unfolding. 98 Figure 27: Random spiral unfolding of H. 4

15 Figure 28: Normal vectors to H faces (Figure 22). The single vector in the southern hemisphere derives from the horizontal base. Figure 29: A zipper path that unfolds the hemiball H. 5

16 it unfolds to two connected regular polygons. 6 Polyhedra of Revolution In this section we study a narrow class of convex polyhedra whose spiral unfoldings are easily understood. I believe this sheds light on the general case. The class is polyhedra of revolution, formed as follows. Let C be a convex curve in the yz-halfplane with x 0. Spin this curve around the z-axis, forming n spin discrete copies. Then take the convex hull to form P. Two examples for the same C are shown Figure 30. Note the faces of such Figure 30: Polyhedra of revolution, with C shown, and n spin = 4 and 20. The spiral cut-path σ is shown on the left polyhedron. a P are trapezoids, but in the triangulated figure, each trapezoid is cut by a diagonal. Let v be a vertex of C. The natural spiral cut-path σ we explore circles around the horizontal regular polygon of n spin sides formed by each v, following a trapezoid diagonal to the next ring upward. 2 Typical spiral unfoldings are shown in Figure 3. Here we see overlap for n spin 4, just barely nonoverlap for n spin = 6, and nonoverlap for all larger n spin. The claim of this section is that this is the general situation: Proposition 2 For any convex curve C, there is some 3 n spin 2 such that the spiral unfolding of the polyhedron of revolution determined by C and all n spin does not overlap. 2 If σ follows a vertical trapezoid edge rather than the coplanar diagonal, σ would constitute a Hamiltonian edge-unfolding. 3 n spin = 2 produces a flat, doubly covered convex polygon, which is usually considered a convex polyhedron in the context of unfolding. 6

17 overlap 28 n spin =4 40 n spin =6 no overlap 24 no overlap n spin =20 Figure 3: Spiral unfoldings of the shape in Figure 30, for n spin = 4, 6, 20. 7

18 We now argue for this proposition, somewhat informally. First, it helps to imagine n spin. Then σ follows horizontal circles around P, and the vertical diagonal cuts join adjacent circles orthogonal to both. Second, view adjacent bands as deriving from nested cones, as depicted in Figure 32. Let β be the half-angle of a cone in R 3, and let α be the total surface Figure 32: Nested cones determined by adjacent bands. angle at the cone apex, i.e., the angle of the wedge when the cone is cut open along a generator and flattened to R 2. Then α = 2π sin β, which implies that these angles grow and shrink together monotonically. Let B be the lower band and B 2 the upper band, sharing a circle of radius r. Then β < β 2 and so α < α 2. Let ρ be the planar layout curve with surface to the right, and λ the curve with surface to the left. Each unfolded band B is bounded by ρ and λ, each of which is an arc of a circle centered on the image of the apex of the cone containing B. Consider again two adjacent bands B and B 2 sharing a horizontal circle of σ. B is right of σ and B 2 left of σ on P. B unfolds to a strip bounded by circle arcs of radius r strictly larger than the radius r 2. The shared seam between B and B 2 therefore unfolds to ρ and λ 2 as illustrated in Figure 33. The arcs ρ and λ 2 share a common tangent at the orthogonal cuts to adjacent bands, when n spin. The centers of the circle arcs are aligned so that c and c 2 are collinear with that point of common tangency. So now it is clear that each band unfolding sits inside an annulus, with each annulus nested inside and tangent to its z-lower mate. Thus the bands cannot intersect one another except where they join. Of course the same holds at each 8

19 r c B 2 ρ c 2 λ 2 B r 2 Figure 33: Portion of a spiral unfolding with band circles illustrated (polyhedron of revolution not shown). We must have r > r 2, and ρ joining smoothly with λ 2, and so the B 2 annulus is tangent to and nested inside the B annulus. 9

20 end of any polyhedron of revolution P, with the nesting occurring to the other side of the unfolding. The only possible overlap occurs for small n spin, when two regular polygons are separated near the unfolding of the apex of P, as we saw in Figure 3. But for any apex curvature ω, regardless of how small, there is some n spin that avoids overlap, as do all larger n spin values. 6. Relationship to arbitrary P. For arbitrary P, the bands are not as circular, and do not necessarily lie on cones. But one can see an analogous structure to spiral unfoldings: bands are unfolded and attached, increasing in radii away from the apexes of P. The more vertices of P, and the more circular each cross-section, the closer will a spiral unfolding resemble an unfolding of a polyhedron of revolution. This incidentaly reinforces the intuition of why nonoverlap is rare: even with polyhedra of revolution, the nesting to avoid overlap is delicate. 6.2 Nonconvex Polyhedra of Revolution We end this section with a curiosity: some spiral unfoldings of nonconvex polyhedra avoid overlap. Figure 34 shows a nonconvex polyhedron of revolution and a nonoverlapping unfolding. But this cannot be pushed too far, as the right overlapping unfolding demonstrates n spin =3 n spin =6 Figure 34: A peanut-shaped polyhedron of revolution, for two different n spin values (sharing the same curve C). 20

21 7 Conjecture We mentioned in Section that it was posed as an open question in [LDD + 0] whether or not every convex polyhedron has a nonoverlapping zipper unfolding. The spiral unfoldings we explored here are a narrow class of zipper unfoldings, and shed no direct light on the open problem. Rather than require a spiral to pass through the vertices in vertical order, one could imagine loosening the definition to allow spiral-like paths that rely more on intrinsic surface features rather than on an extrinsic vertical sorting. I have explored this direction enough to know that some overlaps can be avoided with more general spirals. Nevertheless, this effort has led me to conjecture that the answer to the Lubiw et al. open problem is No: there are polyhedra whose every zipper unfolding overlaps. I reach this conclusion through two hunches. First, although there are a vast number of possible zipper unfoldings for polyhedra with many vertices n, if the vertices are sprinkled uniformly but unorganized, spiral-like paths are the only real options. Second, for polyhedra that are close to spheres with many unorganized vertices, any spiral will overlap. So I suggest two similar candidates for counterexamples: () P is the convex hull of a large number of random points on a sphere; (2) P is geodesic dome, but with the vertices perturbed slightly to break all symmetries. Figure 35 shows the second example, and Figure 36 shows a spiral unfolding. Figure 35: Geodesic dome with perturbed vertices. The irregularity of the vertex positions causes significant overlap along many turns of the spiral. 2

22 References Figure 36: Overlapping spiral unfolding of a geodesic dome. [DO07] Erik D. Demaine and Joseph O Rourke. Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, July [LDD + 0] Anna Lubiw, Erik Demaine, Martin Demaine, Arlo Shallit, and Jonah Shallit. Zipper unfoldings of polyhedral complexes. In Proc. 22nd Canad. Conf. Comput. Geom., pages , August 200. [She75] Geoffrey C. Shephard. Convex polytopes with convex nets. Math. Proc. Camb. Phil. Soc., 78: ,

arxiv:submit/ [cs.cg] 8 Jun 2011

arxiv:submit/ [cs.cg] 8 Jun 2011 Common Edge-Unzippings for Tetrahedra Joseph O Rourke arxiv:submit/68 [cs.cg] 8 Jun June 8, Abstract It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which

More information

Zipper Unfoldings of Polyhedral Complexes

Zipper Unfoldings of Polyhedral Complexes Zipper Unfoldings of Polyhedral Complexes Erik D. Demaine Martin L. Demaine Anna Lubiw Arlo Shallit Jonah L. Shallit Abstract We explore which polyhedra and polyhedral complexes can be formed by folding

More information

arxiv: v1 [cs.cg] 11 Sep 2007

arxiv: v1 [cs.cg] 11 Sep 2007 Unfolding Restricted Convex Caps Joseph O Rourke arxiv:0709.1647v1 [cs.cg] 11 Sep 2007 September 11, 2007 Abstract This paper details an algorithm for unfolding a class of convex polyhedra, where each

More information

Zipper Unfoldings of Polyhedral Complexes. Erik Demaine Martin Demaine Anna Lubiw Arlo Shallit Jonah Shallit

Zipper Unfoldings of Polyhedral Complexes. Erik Demaine Martin Demaine Anna Lubiw Arlo Shallit Jonah Shallit Zipper Unfoldings of Polyhedral Complexes Erik Demaine Martin Demaine Anna Lubiw Arlo Shallit Jonah Shallit 1 Unfolding Polyhedra Durer 1400 s Durer, 1498 snub cube 2 Unfolding Polyhedra Octahedron all

More information

Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results

Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results CCCG 2013, Waterloo, Ontario, August 8 10, 2013 Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results Joseph O Rourke Abstract We address unsolved problems of unfolding polyhedra

More information

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. Solid geometry We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. First, note that everything we have proven for the

More information

arxiv: v1 [cs.cg] 9 May 2012

arxiv: v1 [cs.cg] 9 May 2012 CCCG 2012, Charlottetown, P.E.I., August 8 10, 2012 Unfolding Prismatoids as Convex Patches: Counterexamples and Positive Results Joseph O Rourke arxiv:1205.2048v1 [cs.cg] 9 May 2012 Abstract We address

More information

Unfolding Prismatoids as Convex Patches: Counterexamples and Positive Results

Unfolding Prismatoids as Convex Patches: Counterexamples and Positive Results CCCG 2012, Charlottetown, P.E.I., August 8 10, 2012 Unfolding Prismatoids as Convex Patches: Counterexamples and Positive Results Joseph O Rourke Abstract We address the unsolved problem of unfolding prismatoids

More information

arxiv: v1 [cs.cg] 25 Jul 2016

arxiv: v1 [cs.cg] 25 Jul 2016 Unfolding Convex Polyhedra via Radially Monotone Cut Trees arxiv:1607.07421v1 [cs.cg] 25 Jul 2016 Joseph O Rourke July 26, 2016 Abstract A notion of radially monotone cut paths is introduced as an effective

More information

Refold rigidity of convex polyhedra

Refold rigidity of convex polyhedra Refold rigidity of convex polyhedra The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Demaine, Erik

More information

arxiv: v4 [cs.cg] 12 Jul 2007

arxiv: v4 [cs.cg] 12 Jul 2007 Unfolding Orthogonal Terrains Joseph O Rourke arxiv:0707.060v4 [cs.cg] Jul 007 Jul, 007 Abstract It is shown that ever orthogonal terrain, i.e., an orthogonal (rightangled) polhedron based on a rectangle

More information

1 Appendix to notes 2, on Hyperbolic geometry:

1 Appendix to notes 2, on Hyperbolic geometry: 1230, notes 3 1 Appendix to notes 2, on Hyperbolic geometry: The axioms of hyperbolic geometry are axioms 1-4 of Euclid, plus an alternative to axiom 5: Axiom 5-h: Given a line l and a point p not on l,

More information

Example: The following is an example of a polyhedron. Fill the blanks with the appropriate answer. Vertices:

Example: The following is an example of a polyhedron. Fill the blanks with the appropriate answer. Vertices: 11.1: Space Figures and Cross Sections Polyhedron: solid that is bounded by polygons Faces: polygons that enclose a polyhedron Edge: line segment that faces meet and form Vertex: point or corner where

More information

The radius for a regular polygon is the same as the radius of the circumscribed circle.

The radius for a regular polygon is the same as the radius of the circumscribed circle. Perimeter and Area The perimeter and area of geometric shapes are basic properties that we need to know. The more complex a shape is, the more complex the process can be in finding its perimeter and area.

More information

Glossary of dictionary terms in the AP geometry units

Glossary of dictionary terms in the AP geometry units Glossary of dictionary terms in the AP geometry units affine linear equation: an equation in which both sides are sums of terms that are either a number times y or a number times x or just a number [SlL2-D5]

More information

Answer Key: Three-Dimensional Cross Sections

Answer Key: Three-Dimensional Cross Sections Geometry A Unit Answer Key: Three-Dimensional Cross Sections Name Date Objectives In this lesson, you will: visualize three-dimensional objects from different perspectives be able to create a projection

More information

Unfolding Rectangle-Faced Orthostacks

Unfolding Rectangle-Faced Orthostacks Unfolding Rectangle-Faced Orthostacks Erin W. Chambers Kyle A. Sykes Cynthia M. Traub Abstract We prove that rectangle-faced orthostacks, a restricted class of orthostacks, can be grid-edge unfolded without

More information

arxiv: v1 [cs.cg] 1 Jul 2017

arxiv: v1 [cs.cg] 1 Jul 2017 CCCG 2017, Ottawa, Ontario, July 26 28, 2017 Angle-monotone Paths in Non-obtuse Triangulations Anna Lubiw Joseph O Rourke arxiv:1707.00219v1 [cs.cg] 1 Jul 2017 Abstract We reprove a result of Dehkordi,

More information

Question. Why is the third shape not convex?

Question. Why is the third shape not convex? 1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third

More information

7. The Gauss-Bonnet theorem

7. The Gauss-Bonnet theorem 7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed

More information

11.4 Three-Dimensional Figures

11.4 Three-Dimensional Figures 11. Three-Dimensional Figures Essential Question What is the relationship between the numbers of vertices V, edges E, and faces F of a polyhedron? A polyhedron is a solid that is bounded by polygons, called

More information

SHAPE AND STRUCTURE. Shape and Structure. An explanation of Mathematical terminology

SHAPE AND STRUCTURE. Shape and Structure. An explanation of Mathematical terminology Shape and Structure An explanation of Mathematical terminology 2005 1 POINT A dot Dots join to make lines LINE A line is 1 dimensional (length) A line is a series of points touching each other and extending

More information

THE DNA INEQUALITY POWER ROUND

THE DNA INEQUALITY POWER ROUND THE DNA INEQUALITY POWER ROUND Instructions Write/draw all solutions neatly, with at most one question per page, clearly numbered. Turn in the solutions in numerical order, with your team name at the upper

More information

arxiv: v1 [cs.cg] 19 Jul 2010

arxiv: v1 [cs.cg] 19 Jul 2010 On Folding a Polygon to a Polyhedron Joseph O Rourke arxiv:1007.3181v1 [cs.cg] 19 Jul 2010 July 20, 2010 Abstract We show that the open problem presented in Geometric Folding Algorithms: Linkages, Origami,

More information

25. How would you make the octahedral die shown below?

25. How would you make the octahedral die shown below? 304450_ch_08_enqxd 12/6/06 1:39 PM Page 577 Chapter Summary 577 draw others you will not necessarily need all of them. Describe your method, other than random trial and error. How confident are you that

More information

1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.

1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. 1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third

More information

Flavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville

Flavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville Flavor of Computational Geometry Convex Hull in 2D Shireen Y. Elhabian Aly A. Farag University of Louisville February 2010 Agenda Introduction Definitions of Convexity and Convex Hulls Naïve Algorithms

More information

A Topologically Convex Vertex-Ununfoldable Polyhedron

A Topologically Convex Vertex-Ununfoldable Polyhedron A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel 1 Erik D. Demaine 2 Martin L. Demaine 2 1 MIT Department of Mathematics 2 MIT CSAIL CCCG 2011 Abel, Demaine, and Demaine (MIT) A Vertex-Ununfoldable

More information

When Can a Polygon. Fold to a Polytope? Anna Lubiw. Joseph O'Rourke y. Abstract

When Can a Polygon. Fold to a Polytope? Anna Lubiw. Joseph O'Rourke y. Abstract When Can a Polygon Fold to a Polytope? Anna Lubiw Joseph O'Rourke y June 24, 1996 Abstract We show that the decision question posed in the title can be answered with an algorithm of time and space complexity

More information

Explore Solids

Explore Solids 1212.1 Explore Solids Surface Area and Volume of Solids 12.2 Surface Area of Prisms and Cylinders 12.3 Surface Area of Pyramids and Cones 12.4 Volume of Prisms and Cylinders 12.5 Volume of Pyramids and

More information

Week 7 Convex Hulls in 3D

Week 7 Convex Hulls in 3D 1 Week 7 Convex Hulls in 3D 2 Polyhedra A polyhedron is the natural generalization of a 2D polygon to 3D 3 Closed Polyhedral Surface A closed polyhedral surface is a finite set of interior disjoint polygons

More information

Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001

Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001 Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001 Which unit-side-length convex polygons can be formed by packing together unit squares and unit equilateral triangles? For instance

More information

The Jitterbug Motion

The Jitterbug Motion The By 80-4 Poplar St. Rochester, NY 460 Copyright, September 00 09-9-00 Introduction We develop a set of equations which describes the motion of a triangle and a vertex of the Jitterbug. The Jitterbug

More information

of Nebraska - Lincoln

of Nebraska - Lincoln University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2008 Archimedean Solids Anna Anderson University of

More information

Curvature Berkeley Math Circle January 08, 2013

Curvature Berkeley Math Circle January 08, 2013 Curvature Berkeley Math Circle January 08, 2013 Linda Green linda@marinmathcircle.org Parts of this handout are taken from Geometry and the Imagination by John Conway, Peter Doyle, Jane Gilman, and Bill

More information

Partitioning Regular Polygons Into Circular Pieces II: Nonconvex Partitions

Partitioning Regular Polygons Into Circular Pieces II: Nonconvex Partitions Smith ScholarWorks Computer Science: Faculty Publications Computer Science --4 Partitioning Regular Polygons Into Circular Pieces II: Nonconvex Partitions Mirela Damian Villanova University Joseph O'Rourke

More information

A Generalization of the Source Unfolding of Convex Polyhedra

A Generalization of the Source Unfolding of Convex Polyhedra Generalization of the Source Unfolding of onvex Polyhedra The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. itation s Published Publisher

More information

Suggested List of Mathematical Language. Geometry

Suggested List of Mathematical Language. Geometry Suggested List of Mathematical Language Geometry Problem Solving A additive property of equality algorithm apply constraints construct discover explore generalization inductive reasoning parameters reason

More information

Math 489 Project 1: Explore a Math Problem L. Hogben 1 Possible Topics for Project 1: Explore a Math Problem draft 1/13/03

Math 489 Project 1: Explore a Math Problem L. Hogben 1 Possible Topics for Project 1: Explore a Math Problem draft 1/13/03 Math 489 Project 1: Explore a Math Problem L. Hogben 1 Possible Topics for Project 1: Explore a Math Problem draft 1/13/03 Number Base and Regularity We use base 10. The Babylonians used base 60. Discuss

More information

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful

More information

Geometry Vocabulary Math Fundamentals Reference Sheet Page 1

Geometry Vocabulary Math Fundamentals Reference Sheet Page 1 Math Fundamentals Reference Sheet Page 1 Acute Angle An angle whose measure is between 0 and 90 Acute Triangle A that has all acute Adjacent Alternate Interior Angle Two coplanar with a common vertex and

More information

Convex Hulls in Three Dimensions. Polyhedra

Convex Hulls in Three Dimensions. Polyhedra Convex Hulls in Three Dimensions Polyhedra Polyhedron 1.A polyhedron is the generalization of a 2- D polygon to 3-D A finite number of flat polygonal faces The boundary or surface of a polyhedron - Zero-dimensional

More information

Math 366 Lecture Notes Section 11.4 Geometry in Three Dimensions

Math 366 Lecture Notes Section 11.4 Geometry in Three Dimensions Math 366 Lecture Notes Section 11.4 Geometry in Three Dimensions Simple Closed Surfaces A simple closed surface has exactly one interior, no holes, and is hollow. A sphere is the set of all points at a

More information

Partial Results on Convex Polyhedron Unfoldings

Partial Results on Convex Polyhedron Unfoldings Partial Results on Convex Polyhedron Unfoldings Brendan Lucier 004/1/11 Abstract This paper is submitted for credit in the Algorithms for Polyhedra course at the University of Waterloo. We discuss a long-standing

More information

Course Number: Course Title: Geometry

Course Number: Course Title: Geometry Course Number: 1206310 Course Title: Geometry RELATED GLOSSARY TERM DEFINITIONS (89) Altitude The perpendicular distance from the top of a geometric figure to its opposite side. Angle Two rays or two line

More information

Nonorthogonal Polyhedra Built from Rectangles

Nonorthogonal Polyhedra Built from Rectangles Smith ScholarWorks Computer Science: Faculty Publications Computer Science 5-7-2002 Nonorthogonal Polyhedra Built from Rectangles Melody Donoso Smith College Joseph O'Rourke Smith College, jorourke@smith.edu

More information

arxiv: v2 [cs.cg] 24 Jul 2011

arxiv: v2 [cs.cg] 24 Jul 2011 Ice-Creams and Wedge Graphs Eyal Ackerman Tsachik Gelander Rom Pinchasi Abstract arxiv:116.855v2 [cs.cg] 24 Jul 211 What is the minimum angle α > such that given any set of α-directional antennas (that

More information

VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS. ERIK D. DEMAINE MIT Laboratory for Computer Science, 200 Technology

VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS. ERIK D. DEMAINE MIT Laboratory for Computer Science, 200 Technology VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS ERIK D. DEMAINE MIT Laboratory for Computer Science, 200 Technology Square, Cambridge, MA 02139, USA. DAVID EPPSTEIN 1 Department of Information and Computer Science,

More information

Convex Hulls (3D) O Rourke, Chapter 4

Convex Hulls (3D) O Rourke, Chapter 4 Convex Hulls (3D) O Rourke, Chapter 4 Outline Polyhedra Polytopes Euler Characteristic (Oriented) Mesh Representation Polyhedra Definition: A polyhedron is a solid region in 3D space whose boundary is

More information

Platonic Polyhedra and How to Construct Them

Platonic Polyhedra and How to Construct Them Platonic Polyhedra and How to Construct Them Tarun Biswas June 17, 2016 The platonic polyhedra (or platonic solids) are convex regular polyhedra that have identical regular polygons as faces They are characterized

More information

274 Curves on Surfaces, Lecture 5

274 Curves on Surfaces, Lecture 5 274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,

More information

7th Bay Area Mathematical Olympiad

7th Bay Area Mathematical Olympiad 7th Bay Area Mathematical Olympiad February 22, 2005 Problems and Solutions 1 An integer is called formidable if it can be written as a sum of distinct powers of 4, and successful if it can be written

More information

The Geometry of Solids

The Geometry of Solids CONDENSED LESSON 10.1 The Geometry of Solids In this lesson you will Learn about polyhedrons, including prisms and pyramids Learn about solids with curved surfaces, including cylinders, cones, and spheres

More information

Major Facilities for Mathematical Thinking and Understanding. (2) Vision, spatial sense and kinesthetic (motion) sense.

Major Facilities for Mathematical Thinking and Understanding. (2) Vision, spatial sense and kinesthetic (motion) sense. Major Facilities for Mathematical Thinking and Understanding. (2) Vision, spatial sense and kinesthetic (motion) sense. Left brain Right brain Hear what you see. See what you hear. Mobius Strip http://www.metacafe.com/watch/331665/

More information

An Investigation of Closed Geodesics on Regular Polyhedra

An Investigation of Closed Geodesics on Regular Polyhedra An Investigation of Closed Geodesics on Regular Polyhedra Tony Scoles Southern Illinois University Edwardsville May 13, 2008 1 Introduction This paper was undertaken to examine, in detail, results from

More information

Spherical Geometry MATH430

Spherical Geometry MATH430 Spherical Geometry MATH430 Fall 014 In these notes we summarize some results about the geometry of the sphere that complement should the textbook. Most notions we had on the plane (points, lines, angles,

More information

Ma/CS 6b Class 9: Euler s Formula

Ma/CS 6b Class 9: Euler s Formula Ma/CS 6b Class 9: Euler s Formula By Adam Sheffer Recall: Plane Graphs A plane graph is a drawing of a graph in the plane such that the edges are noncrossing curves. 1 Recall: Planar Graphs The drawing

More information

Pick up some wrapping paper.

Pick up some wrapping paper. Pick up some wrapping paper. What is the area of the following Christmas Tree? There is a nice theorem that allows one to compute the area of any simply-connected (i.e. no holes) grid polygon quickly.

More information

arxiv: v1 [math.co] 15 Apr 2018

arxiv: v1 [math.co] 15 Apr 2018 REGULAR POLYGON SURFACES IAN M. ALEVY arxiv:1804.05452v1 [math.co] 15 Apr 2018 Abstract. A regular polygon surface M is a surface graph (Σ, Γ) together with a continuous map ψ from Σ into Euclidean 3-space

More information

Geometry Vocabulary. acute angle-an angle measuring less than 90 degrees

Geometry Vocabulary. acute angle-an angle measuring less than 90 degrees Geometry Vocabulary acute angle-an angle measuring less than 90 degrees angle-the turn or bend between two intersecting lines, line segments, rays, or planes angle bisector-an angle bisector is a ray that

More information

Notes on Spherical Geometry

Notes on Spherical Geometry Notes on Spherical Geometry Abhijit Champanerkar College of Staten Island & The Graduate Center, CUNY Spring 2018 1. Vectors and planes in R 3 To review vector, dot and cross products, lines and planes

More information

Geometry 10 and 11 Notes

Geometry 10 and 11 Notes Geometry 10 and 11 Notes Area and Volume Name Per Date 10.1 Area is the amount of space inside of a two dimensional object. When working with irregular shapes, we can find its area by breaking it up into

More information

Beaumont Middle School Design Project April May 2014 Carl Lee and Craig Schroeder

Beaumont Middle School Design Project April May 2014 Carl Lee and Craig Schroeder Beaumont Middle School Design Project April May 2014 Carl Lee and Craig Schroeder 1 2 SketchUp 1. SketchUp is free, and you can download it from the website www.sketchup.com. For some K12 use, see www.sketchup.com/3dfor/k12-education.

More information

arxiv:cs.cg/ v1 20 Oct 2004

arxiv:cs.cg/ v1 20 Oct 2004 A 2-CHAIN CAN INTERLOCK WITH A k-chain JULIE GLASS, STEFAN LANGERMAN, JOSEPH O ROURKE, JACK SNOEYINK, AND JIANYUAN K. ZHONG arxiv:cs.cg/0410052 v1 20 Oct 2004 Abstract. One of the open problems posed in

More information

Araki, Yoshiaki; Horiyama, Takashi; Author(s) Ryuhei. Citation Lecture Notes in Computer Science, 8.

Araki, Yoshiaki; Horiyama, Takashi; Author(s) Ryuhei. Citation Lecture Notes in Computer Science, 8. JAIST Reposi https://dspace.j Title Common Unfolding of Regular Johnson-Zalgaller Solid Tetrahed Araki, Yoshiaki; Horiyama, Takashi; Author(s) Ryuhei Citation Lecture Notes in Computer Science, 8 Issue

More information

Map-colouring with Polydron

Map-colouring with Polydron Map-colouring with Polydron The 4 Colour Map Theorem says that you never need more than 4 colours to colour a map so that regions with the same colour don t touch. You have to count the region round the

More information

Ice-Creams and Wedge Graphs

Ice-Creams and Wedge Graphs Ice-Creams and Wedge Graphs Eyal Ackerman Tsachik Gelander Rom Pinchasi Abstract What is the minimum angle α > such that given any set of α-directional antennas (that is, antennas each of which can communicate

More information

Chapter 1. acute angle (A), (G) An angle whose measure is greater than 0 and less than 90.

Chapter 1. acute angle (A), (G) An angle whose measure is greater than 0 and less than 90. hapter 1 acute angle (), (G) n angle whose measure is greater than 0 and less than 90. adjacent angles (), (G), (2T) Two coplanar angles that share a common vertex and a common side but have no common

More information

CS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F:

CS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: CS 177 Homework 1 Julian Panetta October, 009 1 Euler Characteristic 1.1 Polyhedral Formula We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: V E + F = 1 First,

More information

Moore Catholic High School Math Department

Moore Catholic High School Math Department Moore Catholic High School Math Department Geometry Vocabulary The following is a list of terms and properties which are necessary for success in a Geometry class. You will be tested on these terms during

More information

Five Platonic Solids: Three Proofs

Five Platonic Solids: Three Proofs Five Platonic Solids: Three Proofs Vincent J. Matsko IMSA, Dodecahedron Day Workshop 18 November 2011 Convex Polygons convex polygons nonconvex polygons Euler s Formula If V denotes the number of vertices

More information

Closed Loops with Antiprisms

Closed Loops with Antiprisms Proceedings of Bridges 2014: Mathematics, Music, Art, Architecture, Culture Closed Loops with Antiprisms Melle Stoel Dacostastraat 18 1053 zc Amsterdam E-mail: mellestoel@gmail.com mellestoel.wordpress.com

More information

NESTED AND FULLY AUGMENTED LINKS

NESTED AND FULLY AUGMENTED LINKS NESTED AND FULLY AUGMENTED LINKS HAYLEY OLSON Abstract. This paper focuses on two subclasses of hyperbolic generalized fully augmented links: fully augmented links and nested links. The link complements

More information

Let a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines, a line which passes through the point P

Let a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines, a line which passes through the point P Let a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines, a line which passes through the point P and parallel to l, can be drawn. A triangle can be

More information

Measuring Lengths The First Fundamental Form

Measuring Lengths The First Fundamental Form Differential Geometry Lia Vas Measuring Lengths The First Fundamental Form Patching up the Coordinate Patches. Recall that a proper coordinate patch of a surface is given by parametric equations x = (x(u,

More information

Planar Graphs and Surfaces. Graphs 2 1/58

Planar Graphs and Surfaces. Graphs 2 1/58 Planar Graphs and Surfaces Graphs 2 1/58 Last time we discussed the Four Color Theorem, which says that any map can be colored with at most 4 colors and not have two regions that share a border having

More information

Polyhedral Models. Hassan Eshaq. Worcester Polytechnic Institute Worcester, MA Abstract

Polyhedral Models. Hassan Eshaq. Worcester Polytechnic Institute Worcester, MA Abstract Polyhedral Models Hassan Eshaq Worcester Polytechnic Institute Worcester, MA 01609-2280 Abstract Consider a polyhedral surface in three-space that has the property that it can change its shape while keeping

More information

A Study of the Rigidity of Regular Polytopes

A Study of the Rigidity of Regular Polytopes A Study of the Rigidity of Regular Polytopes A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University By Helene

More information

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition

More information

A Survey and Recent Results Developments of Two or More

A Survey and Recent Results Developments of Two or More JAIST Reposi https://dspace.j Title A Survey and Recent Results Developments of Two or More About Co Boxes Author(s)Uehara, Ryuhei Citation Origami^6 : proceedings of the sixth international meeting on

More information

1 The Platonic Solids

1 The Platonic Solids 1 The We take the celebration of Dodecahedron Day as an opportunity embark on a discussion of perhaps the best-known and most celebrated of all polyhedra the Platonic solids. Before doing so, however,

More information

PRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES

PRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES UNIT 12 PRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES (A) Main Concepts and Results Let a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines,

More information

Advanced Algorithms Computational Geometry Prof. Karen Daniels. Fall, 2012

Advanced Algorithms Computational Geometry Prof. Karen Daniels. Fall, 2012 UMass Lowell Computer Science 91.504 Advanced Algorithms Computational Geometry Prof. Karen Daniels Fall, 2012 O Rourke Chapter 7 Search & Intersection Chapter 7 Search & Intersection Segment-Segment Intersection

More information

Edge Guards for Polyhedra in Three-Space

Edge Guards for Polyhedra in Three-Space Edge Guards for Polyhedra in Three-Space Javier Cano Csaba D. Tóth Jorge Urrutia Abstract It is shown that every polyhedron in R with m edges can be guarded with at most 27 2m The bound improves to 5 6

More information

Math 311. Polyhedra Name: A Candel CSUN Math

Math 311. Polyhedra Name: A Candel CSUN Math 1. A polygon may be described as a finite region of the plane enclosed by a finite number of segments, arranged in such a way that (a) exactly two segments meets at every vertex, and (b) it is possible

More information

EXTREME POINTS AND AFFINE EQUIVALENCE

EXTREME POINTS AND AFFINE EQUIVALENCE EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard

More information

2009 Geometry Test (Theta) 1. How many lines of symmetry does a regular polygon of s sides have? A. s 3 B. s 2 C. s 1 D. s E. NOTA

2009 Geometry Test (Theta) 1. How many lines of symmetry does a regular polygon of s sides have? A. s 3 B. s 2 C. s 1 D. s E. NOTA 009 Geometry Test (Theta). How many lines of symmetry does a regular polygon of s sides have?. s s. s. s. band of uniform width is cut from three sides of a square. That leaves a rectangle whose area is

More information

INSTRUCTIONS FOR THE USE OF THE SUPER RULE TM

INSTRUCTIONS FOR THE USE OF THE SUPER RULE TM INSTRUCTIONS FOR THE USE OF THE SUPER RULE TM NOTE: All images in this booklet are scale drawings only of template shapes and scales. Preparation: Your SUPER RULE TM is a valuable acquisition for classroom

More information

Hyperbolic structures and triangulations

Hyperbolic structures and triangulations CHAPTER Hyperbolic structures and triangulations In chapter 3, we learned that hyperbolic structures lead to developing maps and holonomy, and that the developing map is a covering map if and only if the

More information

One simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares.

One simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares. Berkeley Math Circle Intermediate I, 1/23, 1/20, 2/6 Presenter: Elysée Wilson-Egolf Topic: Polygons, Polyhedra, Polytope Series Part 1 Polygon Angle Formula Let s start simple. How do we find the sum of

More information

Math 3315: Geometry Vocabulary Review Human Dictionary: WORD BANK

Math 3315: Geometry Vocabulary Review Human Dictionary: WORD BANK Math 3315: Geometry Vocabulary Review Human Dictionary: WORD BANK [acute angle] [acute triangle] [adjacent interior angle] [alternate exterior angles] [alternate interior angles] [altitude] [angle] [angle_addition_postulate]

More information

INTRODUCTION TO 3-MANIFOLDS

INTRODUCTION TO 3-MANIFOLDS INTRODUCTION TO 3-MANIFOLDS NIK AKSAMIT As we know, a topological n-manifold X is a Hausdorff space such that every point contained in it has a neighborhood (is contained in an open set) homeomorphic to

More information

(1) Page #2 26 Even. (2) Page 596 #1 14. (3) Page #15 25 ; FF #26 and 28. (4) Page 603 #1 18. (5) Page #19 26

(1) Page #2 26 Even. (2) Page 596 #1 14. (3) Page #15 25 ; FF #26 and 28. (4) Page 603 #1 18. (5) Page #19 26 Geometry/Trigonometry Unit 10: Surface Area and Volume of Solids Notes Name: Date: Period: # (1) Page 590 591 #2 26 Even (2) Page 596 #1 14 (3) Page 596 597 #15 25 ; FF #26 and 28 (4) Page 603 #1 18 (5)

More information

EXTERNAL VISIBILITY. 1. Definitions and notation. The boundary and interior of

EXTERNAL VISIBILITY. 1. Definitions and notation. The boundary and interior of PACIFIC JOURNAL OF MATHEMATICS Vol. 64, No. 2, 1976 EXTERNAL VISIBILITY EDWIN BUCHMAN AND F. A. VALENTINE It is possible to see any eleven vertices of an opaque solid regular icosahedron from some appropriate

More information

,. ~ ~ Blending Polyhedra with Overlays. 1 Introduction. George W. Hart

,. ~ ~ Blending Polyhedra with Overlays. 1 Introduction. George W. Hart BRIDGES Mathematical Connections in Art, Music~ and Science. Blending Polyhedra with Overlays Douglas Zongker University of Washington Box 352350 Seattle, WA 98195 dougz@cs.washington.edu George W. Hart

More information

751 Problem Set I JWR. Due Sep 28, 2004

751 Problem Set I JWR. Due Sep 28, 2004 751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path

More information

Course: Geometry Year: Teacher(s): various

Course: Geometry Year: Teacher(s): various Course: Geometry Year: 2015-2016 Teacher(s): various Unit 1: Coordinates and Transformations Standards Essential Questions Enduring Understandings G-CO.1. Know 1) How is coordinate Geometric precise definitions

More information

MATHEMATICS. Y4 Understanding shape Visualise, describe and classify 3-D and 2-D shapes. Equipment

MATHEMATICS. Y4 Understanding shape Visualise, describe and classify 3-D and 2-D shapes. Equipment MATHEMATICS Y4 Understanding shape 4501 Visualise, describe and classify 3-D and 2-D shapes Paper, pencil, ruler Equipment Maths Go Go Go 4501 Visualise, describe and classify 3-D and 2-D shapes. Page

More information

arxiv:cs.cg/ v4 3 Aug 2006

arxiv:cs.cg/ v4 3 Aug 2006 On the Development of the Intersection of a Plane with a Polytope Joseph O Rourke arxiv:cs.cg/0006035 v4 3 Aug 2006 Abstract Define a slice curve as the intersection of a plane with the surface of a polytope,

More information

Acute Triangulations of Polygons

Acute Triangulations of Polygons Europ. J. Combinatorics (2002) 23, 45 55 doi:10.1006/eujc.2001.0531 Available online at http://www.idealibrary.com on Acute Triangulations of Polygons H. MAEHARA We prove that every n-gon can be triangulated

More information