A Three Dimensional Shape Made up of Flat Polygonal Faces (F), Straight Edges (E), and Sharp Corners (Vertices – V)

Total Page：16

File Type：pdf, Size：1020Kb

Polyhedron: a three dimensional shape made up of flat polygonal faces (F), straight edges (E), and sharp corners (vertices – V). Platonic solid: a regular, convex polyhedron. It is constructed using the same congruent regular polygonal faces with the same number of faces meeting at each vertex. 1) Is a cube a polyhedron? If so, how many faces does it have (what is F), how many edges does it have (what is E) and how many corners does it have (what is V)? 2) Is the cube a platonic solid? 3) Is a sphere a polyhedron? If so, how many faces does it have (what is F), how many edges does it have (what is E) and how many corners does it have (what is V)? 4) Is the sphere a platonic solid? 5) Is a pyramid a polyhedron? If so, how many faces does it have (what is F), how many edges does it have (what is E) and how many corners does it have (what is V)? 6) Is the pyramid a platonic solid? 7) For all the polyhedra above and on the next pages, what is F – E + V ? 8) Fill in the following table for the Platonic solids: Faces Vertices Edges Tetrahedron Cube Octahedron Dodecahedron Icosahedron 9) Anna is building a new jungle gym. Starting from a frame in the shape of a cube, she attaches ropes that go from the center of each face to the centers of the four adjacent faces. How many ropes does she need in all? What shape do the ropes make? 10) Mika is building her jungle gym the same way, but starting with a frame in the shape of a dodecahedron. How many ropes does she need? Archimedean solid: a polyhedron whose faces are regular polygons where the same polygons meet at each vertex. However, there can be more than one kind of polygon. One example is the cuboctahedron, but there are many more. .

Copy Link

Recommended publications

Equivelar Octahedron of Genus 3 in 3-Space
Equivelar octahedron of genus 3 in 3-space Ruslan Mizhaev ([email protected]) Apr. 2020 ABSTRACT . Building up a toroidal polyhedron of genus 3, consisting of 8 nine-sided faces, is given. From the point of view of topology, a polyhedron can be considered as an embedding of a cubic graph with 24 vertices and 36 edges in a surface of genus 3. This polyhedron is a contender for the maximal genus among octahedrons in 3-space. 1. Introduction This solution can be attributed to the problem of determining the maximal genus of polyhedra with the number of faces - . As is known, at least 7 faces are required for a polyhedron of genus = 1 . For cases ≥ 8 , there are currently few examples. If all faces of the toroidal polyhedron are – gons and all vertices are q-valence ( ≥ 3), such polyhedral are called either locally regular or simply equivelar [1]. The characteristics of polyhedra are abbreviated as , ; [1]. 2. Polyhedron {9, 3; 3} V1. The paper considers building up a polyhedron 9, 3; 3 in 3-space. The faces of a polyhedron are non- convex flat 9-gons without self-intersections. The polyhedron is symmetric when rotated through 1804 around the axis (Fig. 3). One of the features of this polyhedron is that any face has two pairs with which it borders two edges. The polyhedron also has a ratio of angles and faces - = − 1. To describe polyhedra with similar characteristics ( = − 1) we use the Euler formula − + = = 2 − 2, where is the Euler characteristic. Since = 3, the equality 3 = 2 holds true.
[Show full text]
Archimedean Solids
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 Nebraska-Lincoln Follow this and additional works at: https://digitalcommons.unl.edu/mathmidexppap Part of the Science and Mathematics Education Commons Anderson, Anna, "Archimedean Solids" (2008). MAT Exam Expository Papers. 4. https://digitalcommons.unl.edu/mathmidexppap/4 This Article is brought to you for free and open access by the Math in the Middle Institute Partnership at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in MAT Exam Expository Papers by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. Archimedean Solids Anna Anderson In partial fulfillment of the requirements for the Master of Arts in Teaching with a Specialization in the Teaching of Middle Level Mathematics in the Department of Mathematics. Jim Lewis, Advisor July 2008 2 Archimedean Solids A polygon is a simple, closed, planar figure with sides formed by joining line segments, where each line segment intersects exactly two others. If all of the sides have the same length and all of the angles are congruent, the polygon is called regular. The sum of the angles of a regular polygon with n sides, where n is 3 or more, is 180° x (n – 2) degrees. If a regular polygon were connected with other regular polygons in three dimensional space, a polyhedron could be created. In geometry, a polyhedron is a three- dimensional solid which consists of a collection of polygons joined at their edges. The word polyhedron is derived from the Greek word poly (many) and the Indo-European term hedron (seat).
[Show full text]
Shape Skeletons Creating Polyhedra with Straws
Shape Skeletons Creating Polyhedra with Straws Topics: 3-Dimensional Shapes, Regular Solids, Geometry Materials List Drinking straws or stir straws, cut in Use simple materials to investigate regular or advanced 3-dimensional shapes. half Fun to create, these shapes make wonderful showpieces and learning tools! Paperclips to use with the drinking Assembly straws or chenille 1. Choose which shape to construct. Note: the 4-sided tetrahedron, 8-sided stems to use with octahedron, and 20-sided icosahedron have triangular faces and will form sturdier the stir straws skeletal shapes. The 6-sided cube with square faces and the 12-sided Scissors dodecahedron with pentagonal faces will be less sturdy. See the Taking it Appropriate tool for Further section. cutting the wire in the chenille stems, Platonic Solids if used This activity can be used to teach: Common Core Math Tetrahedron Cube Octahedron Dodecahedron Icosahedron Standards: Angles and volume Polyhedron Faces Shape of Face Edges Vertices and measurement Tetrahedron 4 Triangles 6 4 (Measurement & Cube 6 Squares 12 8 Data, Grade 4, 5, 6, & Octahedron 8 Triangles 12 6 7; Grade 5, 3, 4, & 5) Dodecahedron 12 Pentagons 30 20 2-Dimensional and 3- Dimensional Shapes Icosahedron 20 Triangles 30 12 (Geometry, Grades 2- 12) 2. Use the table and images above to construct the selected shape by creating one or Problem Solving and more face shapes and then add straws or join shapes at each of the vertices: Reasoning a. For drinking straws and paperclips: Bend the (Mathematical paperclips so that the 2 loops form a “V” or “L” Practices Grades 2- shape as needed, widen the narrower loop and insert 12) one loop into the end of one straw half, and the other loop into another straw half.
[Show full text]
VOLUME of POLYHEDRA USING a TETRAHEDRON BREAKUP We
VOLUME OF POLYHEDRA USING A TETRAHEDRON BREAKUP We have shown in an earlier note that any two dimensional polygon of N sides may be broken up into N-2 triangles T by drawing N-3 lines L connecting every second vertex. Thus the irregular pentagon shown has N=5,T=3, and L=2- With this information, one is at once led to the question-“ How can the volume of any polyhedron in 3D be determined using a set of smaller 3D volume elements”. These smaller 3D eelements are likely to be tetrahedra . This leads one to the conjecture that – A polyhedron with more four faces can have its volume represented by the sum of a certain number of sub-tetrahedra. The volume of any tetrahedron is given by the scalar triple product |V1xV2∙V3|/6, where the three Vs are vector representations of the three edges of the tetrahedron emanating from the same vertex. Here is a picture of one of these tetrahedra- Note that the base area of such a tetrahedron is given by |V1xV2]/2. When this area is multiplied by 1/3 of the height related to the third vector one finds the volume of any tetrahedron given by- x1 y1 z1 (V1xV2 ) V3 Abs Vol = x y z 6 6 2 2 2 x3 y3 z3 , where x,y, and z are the vector components. The next question which arises is how many tetrahedra are required to completely fill a polyhedron? We can arrive at an answer by looking at several different examples. Starting with one of the simplest examples consider the double-tetrahedron shown- It is clear that the entire volume can be generated by two equal volume tetrahedra whose vertexes are placed at [0,0,sqrt(2/3)] and [0,0,-sqrt(2/3)].
[Show full text]
Polyhedral Harmonics
value is uncertain; 4 Gr a y d o n has suggested values of £estrap + A0 for the first three excited 4,4 + 0,1 v. e. states indicate 11,1 v.e. för D0. The value 6,34 v.e. for Dextrap for SO leads on A rough correlation between Dextrap and bond correction by 0,37 + 0,66 for the'valence states of type is evident for the more stable states of the the two atoms to D0 ^ 5,31 v.e., in approximate agreement with the precisely known value 5,184 v.e. diatomic molecules. Thus the bonds A = A and The valence state for nitrogen, at 27/100 F2 A = A between elements of the first short period (with 2D at 9/25 F2 and 2P at 3/5 F2), is calculated tend to have dissociation energy to the atomic to lie about 1,67 v.e. above the normal state, 4S, valence state equal to about 6,6 v.e. Examples that for the iso-electronic oxygen ion 0+ is 2,34 are 0+ X, 6,51; N2 B, 6,68; N2 a, 6,56; C2 A, v.e., and that for phosphorus is 1,05 v.e. above 7,05; C2 b, 6,55 v.e. An increase, presumably due their normal states. Similarly the bivalent states to the stabilizing effect of the partial ionic cha- of carbon, : C •, the nitrogen ion, : N • and racter of the double bond, is observed when the atoms differ by 0,5 in electronegativity: NO X, Silicon,:Si •, are 0,44 v.e., 0,64 v.e., and 0,28 v.e., 7,69; CN A, 7,62 v.e.
[Show full text]
Arxiv:1705.01294V1
Branes and Polytopes Luca Romano email address: [email protected] ABSTRACT We investigate the hierarchies of half-supersymmetric branes in maximal supergravity theories. By studying the action of the Weyl group of the U-duality group of maximal supergravities we discover a set of universal algebraic rules describing the number of independent 1/2-BPS p-branes, rank by rank, in any dimension. We show that these relations describe the symmetries of certain families of uniform polytopes. This induces a correspondence between half-supersymmetric branes and vertices of opportune uniform polytopes. We show that half-supersymmetric 0-, 1- and 2-branes are in correspondence with the vertices of the k21, 2k1 and 1k2 families of uniform polytopes, respectively, while 3-branes correspond to the vertices of the rectiﬁed version of the 2k1 family. For 4-branes and higher rank solutions we ﬁnd a general behavior. The interpretation of half- supersymmetric solutions as vertices of uniform polytopes reveals some intriguing aspects. One of the most relevant is a triality relation between 0-, 1- and 2-branes. arXiv:1705.01294v1 [hep-th] 3 May 2017 Contents Introduction 2 1 Coxeter Group and Weyl Group 3 1.1 WeylGroup........................................ 6 2 Branes in E11 7 3 Algebraic Structures Behind Half-Supersymmetric Branes 12 4 Branes ad Polytopes 15 Conclusions 27 A Polytopes 30 B Petrie Polygons 30 1 Introduction Since their discovery branes gained a prominent role in the analysis of M-theories and du- alities [1]. One of the most important class of branes consists in Dirichlet branes, or D-branes. D-branes appear in string theory as boundary terms for open strings with mixed Dirichlet-Neumann boundary conditions and, due to their tension, scaling with a negative power of the string cou- pling constant, they are non-perturbative objects [2].
[Show full text]
15 BASIC PROPERTIES of CONVEX POLYTOPES Martin Henk, JÜrgenrichter-Gebert, and GÜnterm
15 BASIC PROPERTIES OF CONVEX POLYTOPES Martin Henk, JürgenRichter-Gebert, and GünterM. Ziegler INTRODUCTION Convex polytopes are fundamental geometric objects that have been investigated since antiquity. The beauty of their theory is nowadays complemented by their im- portance for many other mathematical subjects, ranging from integration theory, algebraic topology, and algebraic geometry to linear and combinatorial optimiza- tion. In this chapter we try to give a short introduction, provide a sketch of \what polytopes look like" and \how they behave," with many explicit examples, and briefly state some main results (where further details are given in subsequent chap- ters of this Handbook). We concentrate on two main topics: • Combinatorial properties: faces (vertices, edges, . , facets) of polytopes and their relations, with special treatments of the classes of low-dimensional poly- topes and of polytopes \with few vertices;" • Geometric properties: volume and surface area, mixed volumes, and quer- massintegrals, including explicit formulas for the cases of the regular simplices, cubes, and cross-polytopes. We refer to Grünbaum [Grü67]for a comprehensive view of polytope theory, and to Ziegler [Zie95] respectively to Gruber [Gru07] and Schneider [Sch14] for detailed treatments of the combinatorial and of the convex geometric aspects of polytope theory. 15.1 COMBINATORIAL STRUCTURE GLOSSARY d V-polytope: The convex hull of a finite set X = fx1; : : : ; xng of points in R , n n X i X P = conv(X) := λix λ1; : : : ; λn ≥ 0; λi = 1 : i=1 i=1 H-polytope: The solution set of a finite system of linear inequalities, d T P = P (A; b) := x 2 R j ai x ≤ bi for 1 ≤ i ≤ m ; with the extra condition that the set of solutions is bounded, that is, such that m×d there is a constant N such that jjxjj ≤ N holds for all x 2 P .
[Show full text]
What Is a Polyhedron?
3. POLYHEDRA, GRAPHS AND SURFACES 3.1. From Polyhedra to Graphs What is a Polyhedron? Now that we’ve covered lots of geometry in two dimensions, let’s make things just a little more difﬁcult. We’re going to consider geometric objects in three dimensions which can be made from two-dimensional pieces. For example, you can take six squares all the same size and glue them together to produce the shape which we call a cube. More generally, if you take a bunch of polygons and glue them together so that no side gets left unglued, then the resulting object is usually called a polyhedron.1 The corners of the polygons are called vertices, the sides of the polygons are called edges and the polygons themselves are called faces. So, for example, the cube has 8 vertices, 12 edges and 6 faces. Different people seem to deﬁne polyhedra in very slightly different ways. For our purposes, we will need to add one little extra condition — that the volume bound by a polyhedron “has no holes”. For example, consider the shape obtained by drilling a square hole straight through the centre of a cube. Even though the surface of such a shape can be constructed by gluing together polygons, we don’t consider this shape to be a polyhedron, because of the hole. We say that a polyhedron is convex if, for each plane which lies along a face, the polyhedron lies on one side of that plane. So, for example, the cube is a convex polyhedron while the more complicated spec- imen of a polyhedron pictured on the right is certainly not convex.
[Show full text]
3. Linear Programming and Polyhedral Combinatorics Summary of What Was Seen in the Introductory Lectures on Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory lectures on linear programming and polyhedral combinatorics. Definition 3.1 A halfspace in Rn is a set of the form fx 2 Rn : aT x ≤ bg for some vector a 2 Rn and b 2 R. Definition 3.2 A polyhedron is the intersection of finitely many halfspaces: P = fx 2 Rn : Ax ≤ bg. Definition 3.3 A polytope is a bounded polyhedron. n n−1 Definition 3.4 If P is a polyhedron in R , the projection Pk ⊆ R of P is defined as fy = (x1; x2; ··· ; xk−1; xk+1; ··· ; xn): x 2 P for some xkg. This is a special case of a projection onto a linear space (here, we consider only coordinate projection). By repeatedly projecting, we can eliminate any subset of coordinates. We claim that Pk is also a polyhedron and this can be proved by giving an explicit description of Pk in terms of linear inequalities. For this purpose, one uses Fourier-Motzkin elimination. Let P = fx : Ax ≤ bg and let • S+ = fi : aik > 0g, • S− = fi : aik < 0g, • S0 = fi : aik = 0g. T Clearly, any element in Pk must satisfy the inequality ai x ≤ bi for all i 2 S0 (these inequal- ities do not involve xk). Similarly, we can take a linear combination of an inequality in S+ and one in S− to eliminate the coefficient of xk. This shows that the inequalities: ! ! X X aik aljxj − alk aijxj ≤ aikbl − alkbi (1) j j for i 2 S+ and l 2 S− are satisfied by all elements of Pk.
[Show full text]
Frequently Asked Questions in Polyhedral Computation
Frequently Asked Questions in Polyhedral Computation http://www.ifor.math.ethz.ch/~fukuda/polyfaq/polyfaq.html Komei Fukuda Swiss Federal Institute of Technology Lausanne and Zurich, Switzerland [email protected] Version June 18, 2004 Contents 1 What is Polyhedral Computation FAQ? 2 2 Convex Polyhedron 3 2.1 What is convex polytope/polyhedron? . 3 2.2 What are the faces of a convex polytope/polyhedron? . 3 2.3 What is the face lattice of a convex polytope . 4 2.4 What is a dual of a convex polytope? . 4 2.5 What is simplex? . 4 2.6 What is cube/hypercube/cross polytope? . 5 2.7 What is simple/simplicial polytope? . 5 2.8 What is 0-1 polytope? . 5 2.9 What is the best upper bound of the numbers of k-dimensional faces of a d- polytope with n vertices? . 5 2.10 What is convex hull? What is the convex hull problem? . 6 2.11 What is the Minkowski-Weyl theorem for convex polyhedra? . 6 2.12 What is the vertex enumeration problem, and what is the facet enumeration problem? . 7 1 2.13 How can one enumerate all faces of a convex polyhedron? . 7 2.14 What computer models are appropriate for the polyhedral computation? . 8 2.15 How do we measure the complexity of a convex hull algorithm? . 8 2.16 How many facets does the average polytope with n vertices in Rd have? . 9 2.17 How many facets can a 0-1 polytope with n vertices in Rd have? . 10 2.18 How hard is it to verify that an H-polyhedron PH and a V-polyhedron PV are equal? .
[Show full text]
Certain Cube Puzzles 1
UNITED STATES INTERNATIONAL TRADE COMMISSION COMMISSIONERS Alfred E. Eckes, Chairman Paula Stern Veronica A. Haggart Kenneth R. Mason, Secretary to the Commission Address all communications to Office of the Secretary United States International Trade Commission Washington, D.C. 20436 UNITED STATES INTEPWATIONAt TRADE COMMTSSIOV Washington, D.C. 20436 In the Matter of i 1 Investi pat i on Po 337-TA-11? CERTAIN CUBE PUZZLES 1 -u__ 1 COMMISSION ACTION ABJD ORDEP Introc'uctfon The United States International Trade Commission h~sconcl~~~~~+ it6 /I9 investigation under section 337 of the Tariff Art of 3'1.30 !ImS*C* e 1?37), of alleged unfair methods of competition and unfaJr acts :n the unailthor4~eCI importation of certain cube piizzles into the United Stntesg or in Lhe3r sale by the owner, importer, consipnee, or aeent of either, the alleged pffprt n~" tendency of which is to destroy or substantially Jnjrire an industry, efficiently and economically operated, ?n the United States" The ~O~~F?+W'S investigation concerned allegations of (1) infrinpevrt rf common-law trademarks of complainant Ideal Toy COX^., (2) false reprwmtPtfon by copytnp complainant's trade dress, and (3) pass?ng off of yrSpnndents' CI:'~Ppuwies as those of complainant. This Action and Order provjeea for the final dispositfon of Tt No. 337-TA-112 by the Commission. fc: based upon the Cnmissioa'~ determination (Commissioner Stern dlscortjng), macle in pnblic sessfin at t).~ P Commission meeting of Dscemher 15, 1982, thnt there I- violatfon of s~~ltforl 337. 2 Action Having reviewed the record compiled and information developed in this investigation, including (1) the submissions filed by the parties, (2) the transcript of the evidentiary hearing before the AW and the exhibits which were accepted into evidence, (3) the Am's recommended determination, and (4) the arguments and presentations made by the parties and witnesses at the Commission's public hearing on November 18, 1982, the Commisson on December 15, 1982, determined (Commissioner Stern dissenting) that- 1.
[Show full text]
Are Your Polyhedra the Same As My Polyhedra?
Are Your Polyhedra the Same as My Polyhedra? Branko Grünbaum 1 Introduction “Polyhedron” means different things to different people. There is very little in common between the meaning of the word in topology and in geometry. But even if we confine attention to geometry of the 3-dimensional Euclidean space – as we shall do from now on – “polyhedron” can mean either a solid (as in “Platonic solids”, convex polyhedron, and other contexts), or a surface (such as the polyhedral models constructed from cardboard using “nets”, which were introduced by Albrecht Dürer [17] in 1525, or, in a more mod- ern version, by Aleksandrov [1]), or the 1-dimensional complex consisting of points (“vertices”) and line-segments (“edges”) organized in a suitable way into polygons (“faces”) subject to certain restrictions (“skeletal polyhedra”, diagrams of which have been presented first by Luca Pacioli [44] in 1498 and attributed to Leonardo da Vinci). The last alternative is the least usual one – but it is close to what seems to be the most useful approach to the theory of general polyhedra. Indeed, it does not restrict faces to be planar, and it makes possible to retrieve the other characterizations in circumstances in which they reasonably apply: If the faces of a “surface” polyhedron are sim- ple polygons, in most cases the polyhedron is unambiguously determined by the boundary circuits of the faces. And if the polyhedron itself is without selfintersections, then the “solid” can be found from the faces. These reasons, as well as some others, seem to warrant the choice of our approach.
[Show full text]