Platonic Solids William Chen in Two Dimensions, We Have Polygons. It Is
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
On the Archimedean Or Semiregular Polyhedra
ON THE ARCHIMEDEAN OR SEMIREGULAR POLYHEDRA Mark B. Villarino Depto. de Matem´atica, Universidad de Costa Rica, 2060 San Jos´e, Costa Rica May 11, 2005 Abstract We prove that there are thirteen Archimedean/semiregular polyhedra by using Euler’s polyhedral formula. Contents 1 Introduction 2 1.1 RegularPolyhedra .............................. 2 1.2 Archimedean/semiregular polyhedra . ..... 2 2 Proof techniques 3 2.1 Euclid’s proof for regular polyhedra . ..... 3 2.2 Euler’s polyhedral formula for regular polyhedra . ......... 4 2.3 ProofsofArchimedes’theorem. .. 4 3 Three lemmas 5 3.1 Lemma1.................................... 5 3.2 Lemma2.................................... 6 3.3 Lemma3.................................... 7 4 Topological Proof of Archimedes’ theorem 8 arXiv:math/0505488v1 [math.GT] 24 May 2005 4.1 Case1: fivefacesmeetatavertex: r=5. .. 8 4.1.1 At least one face is a triangle: p1 =3................ 8 4.1.2 All faces have at least four sides: p1 > 4 .............. 9 4.2 Case2: fourfacesmeetatavertex: r=4 . .. 10 4.2.1 At least one face is a triangle: p1 =3................ 10 4.2.2 All faces have at least four sides: p1 > 4 .............. 11 4.3 Case3: threefacesmeetatavertes: r=3 . ... 11 4.3.1 At least one face is a triangle: p1 =3................ 11 4.3.2 All faces have at least four sides and one exactly four sides: p1 =4 6 p2 6 p3. 12 4.3.3 All faces have at least five sides and one exactly five sides: p1 =5 6 p2 6 p3 13 1 5 Summary of our results 13 6 Final remarks 14 1 Introduction 1.1 Regular Polyhedra A polyhedron may be intuitively conceived as a “solid figure” bounded by plane faces and straight line edges so arranged that every edge joins exactly two (no more, no less) vertices and is a common side of two faces. -
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). -
A Congruence Problem for Polyhedra
A congruence problem for polyhedra Alexander Borisov, Mark Dickinson, Stuart Hastings April 18, 2007 Abstract It is well known that to determine a triangle up to congruence requires 3 measurements: three sides, two sides and the included angle, or one side and two angles. We consider various generalizations of this fact to two and three dimensions. In particular we consider the following question: given a convex polyhedron P , how many measurements are required to determine P up to congruence? We show that in general the answer is that the number of measurements required is equal to the number of edges of the polyhedron. However, for many polyhedra fewer measurements suffice; in the case of the cube we show that nine carefully chosen measurements are enough. We also prove a number of analogous results for planar polygons. In particular we describe a variety of quadrilaterals, including all rhombi and all rectangles, that can be determined up to congruence with only four measurements, and we prove the existence of n-gons requiring only n measurements. Finally, we show that one cannot do better: for any ordered set of n distinct points in the plane one needs at least n measurements to determine this set up to congruence. An appendix by David Allwright shows that the set of twelve face-diagonals of the cube fails to determine the cube up to conjugacy. Allwright gives a classification of all hexahedra with all face- diagonals of equal length. 1 Introduction We discuss a class of problems about the congruence or similarity of three dimensional polyhedra. -
Binary Icosahedral Group and 600-Cell
Article Binary Icosahedral Group and 600-Cell Jihyun Choi and Jae-Hyouk Lee * Department of Mathematics, Ewha Womans University 52, Ewhayeodae-gil, Seodaemun-gu, Seoul 03760, Korea; [email protected] * Correspondence: [email protected]; Tel.: +82-2-3277-3346 Received: 10 July 2018; Accepted: 26 July 2018; Published: 7 August 2018 Abstract: In this article, we have an explicit description of the binary isosahedral group as a 600-cell. We introduce a method to construct binary polyhedral groups as a subset of quaternions H via spin map of SO(3). In addition, we show that the binary icosahedral group in H is the set of vertices of a 600-cell by applying the Coxeter–Dynkin diagram of H4. Keywords: binary polyhedral group; icosahedron; dodecahedron; 600-cell MSC: 52B10, 52B11, 52B15 1. Introduction The classification of finite subgroups in SLn(C) derives attention from various research areas in mathematics. Especially when n = 2, it is related to McKay correspondence and ADE singularity theory [1]. The list of finite subgroups of SL2(C) consists of cyclic groups (Zn), binary dihedral groups corresponded to the symmetry group of regular 2n-gons, and binary polyhedral groups related to regular polyhedra. These are related to the classification of regular polyhedrons known as Platonic solids. There are five platonic solids (tetrahedron, cubic, octahedron, dodecahedron, icosahedron), but, as a regular polyhedron and its dual polyhedron are associated with the same symmetry groups, there are only three binary polyhedral groups(binary tetrahedral group 2T, binary octahedral group 2O, binary icosahedral group 2I) related to regular polyhedrons. -
Can Every Face of a Polyhedron Have Many Sides ?
Can Every Face of a Polyhedron Have Many Sides ? Branko Grünbaum Dedicated to Joe Malkevitch, an old friend and colleague, who was always partial to polyhedra Abstract. The simple question of the title has many different answers, depending on the kinds of faces we are willing to consider, on the types of polyhedra we admit, and on the symmetries we require. Known results and open problems about this topic are presented. The main classes of objects considered here are the following, listed in increasing generality: Faces: convex n-gons, starshaped n-gons, simple n-gons –– for n ≥ 3. Polyhedra (in Euclidean 3-dimensional space): convex polyhedra, starshaped polyhedra, acoptic polyhedra, polyhedra with selfintersections. Symmetry properties of polyhedra P: Isohedron –– all faces of P in one orbit under the group of symmetries of P; monohedron –– all faces of P are mutually congru- ent; ekahedron –– all faces have of P the same number of sides (eka –– Sanskrit for "one"). If the number of sides is k, we shall use (k)-isohedron, (k)-monohedron, and (k)- ekahedron, as appropriate. We shall first describe the results that either can be found in the literature, or ob- tained by slight modifications of these. Then we shall show how two systematic ap- proaches can be used to obtain results that are better –– although in some cases less visu- ally attractive than the old ones. There are many possible combinations of these classes of faces, polyhedra and symmetries, but considerable reductions in their number are possible; we start with one of these, which is well known even if it is hard to give specific references for precisely the assertion of Theorem 1. -
Fundamental Principles Governing the Patterning of Polyhedra
FUNDAMENTAL PRINCIPLES GOVERNING THE PATTERNING OF POLYHEDRA B.G. Thomas and M.A. Hann School of Design, University of Leeds, Leeds LS2 9JT, UK. [email protected] ABSTRACT: This paper is concerned with the regular patterning (or tiling) of the five regular polyhedra (known as the Platonic solids). The symmetries of the seventeen classes of regularly repeating patterns are considered, and those pattern classes that are capable of tiling each solid are identified. Based largely on considering the symmetry characteristics of both the pattern and the solid, a first step is made towards generating a series of rules governing the regular tiling of three-dimensional objects. Key words: symmetry, tilings, polyhedra 1. INTRODUCTION A polyhedron has been defined by Coxeter as “a finite, connected set of plane polygons, such that every side of each polygon belongs also to just one other polygon, with the provision that the polygons surrounding each vertex form a single circuit” (Coxeter, 1948, p.4). The polygons that join to form polyhedra are called faces, 1 these faces meet at edges, and edges come together at vertices. The polyhedron forms a single closed surface, dissecting space into two regions, the interior, which is finite, and the exterior that is infinite (Coxeter, 1948, p.5). The regularity of polyhedra involves regular faces, equally surrounded vertices and equal solid angles (Coxeter, 1948, p.16). Under these conditions, there are nine regular polyhedra, five being the convex Platonic solids and four being the concave Kepler-Poinsot solids. The term regular polyhedron is often used to refer only to the Platonic solids (Cromwell, 1997, p.53). -
Putting the Icosahedron Into the Octahedron
Forum Geometricorum Volume 17 (2017) 63–71. FORUM GEOM ISSN 1534-1178 Putting the Icosahedron into the Octahedron Paris Pamfilos Abstract. We compute the dimensions of a regular tetragonal pyramid, which allows a cut by a plane along a regular pentagon. In addition, we relate this construction to a simple construction of the icosahedron and make a conjecture on the impossibility to generalize such sections of regular pyramids. 1. Pentagonal sections The present discussion could be entitled Organizing calculations with Menelaos, and originates from a problem from the book of Sharygin [2, p. 147], in which it is required to construct a pentagonal section of a regular pyramid with quadrangular F J I D T L C K H E M a x A G B U V Figure 1. Pentagonal section of quadrangular pyramid basis. The basis of the pyramid is a square of side-length a and the pyramid is assumed to be regular, i.e. its apex F is located on the orthogonal at the center E of the square at a distance h = |EF| from it (See Figure 1). The exercise asks for the determination of the height h if we know that there is a section GHIJK of the pyramid by a plane which is a regular pentagon. The section is tacitly assumed to be symmetric with respect to the diagonal symmetry plane AF C of the pyramid and defined by a plane through the three points K, G, I. The first two, K and G, lying symmetric with respect to the diagonal AC of the square. -
The Crystal Forms of Diamond and Their Significance
THE CRYSTAL FORMS OF DIAMOND AND THEIR SIGNIFICANCE BY SIR C. V. RAMAN AND S. RAMASESHAN (From the Department of Physics, Indian Institute of Science, Bangalore) Received for publication, June 4, 1946 CONTENTS 1. Introductory Statement. 2. General Descriptive Characters. 3~ Some Theoretical Considerations. 4. Geometric Preliminaries. 5. The Configuration of the Edges. 6. The Crystal Symmetry of Diamond. 7. Classification of the Crystal Forros. 8. The Haidinger Diamond. 9. The Triangular Twins. 10. Some Descriptive Notes. 11. The Allo- tropic Modifications of Diamond. 12. Summary. References. Plates. 1. ~NTRODUCTORY STATEMENT THE" crystallography of diamond presents problems of peculiar interest and difficulty. The material as found is usually in the form of complete crystals bounded on all sides by their natural faces, but strangely enough, these faces generally exhibit a marked curvature. The diamonds found in the State of Panna in Central India, for example, are invariably of this kind. Other diamondsJas for example a group of specimens recently acquired for our studies ffom Hyderabad (Deccan)--show both plane and curved faces in combination. Even those diamonds which at first sight seem to resemble the standard forms of geometric crystallography, such as the rhombic dodeca- hedron or the octahedron, are found on scrutiny to exhibit features which preclude such an identification. This is the case, for example, witb. the South African diamonds presented to us for the purpose of these studŸ by the De Beers Mining Corporation of Kimberley. From these facts it is evident that the crystallography of diamond stands in a class by itself apart from that of other substances and needs to be approached from a distinctive stand- point. -
Bridges Conference Proceedings Guidelines Word
Bridges 2019 Conference Proceedings Helixation Rinus Roelofs Lansinkweg 28, Hengelo, the Netherlands; [email protected] Abstract In the list of names of the regular and semi-regular polyhedra we find many names that refer to a process. Examples are ‘truncated’ cube and ‘stellated’ dodecahedron. And Luca Pacioli named some of his polyhedral objects ‘elevations’. This kind of name-giving makes it easier to understand these polyhedra. We can imagine the model as a result of a transformation. And nowadays we are able to visualize this process by using the technique of animation. Here I will to introduce ‘helixation’ as a process to get a better understanding of the Poinsot polyhedra. In this paper I will limit myself to uniform polyhedra. Introduction Most of the Archimedean solids can be derived by cutting away parts of a Platonic solid. This operation , with which we can generate most of the semi-regular solids, is called truncation. Figure 1: Truncation of the cube. We can truncate the vertices of a polyhedron until the original faces of the polyhedron become regular again. In Figure 1 this process is shown starting with a cube. In the third object in the row, the vertices are truncated in such a way that the square faces of the cube are transformed to regular octagons. The resulting object is the Archimedean solid, the truncated cube. We can continue the process until we reach the fifth object in the row, which again is an Archimedean solid, the cuboctahedron. The whole process or can be represented as an animation. Also elevation and stellation can be described as processes. -
Tetrahedral Decompositions of Hexahedral Meshes
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Europ. J. Combinatorics (1989) 10, 435-443 Tetrahedral Decompositions of Hexahedral Meshes DEREK HACON AND CARLOS TOMEI A hexahedral mesh is a partition of a region in 3-space 1R3 into (not necessarily regular) hexahedra which fit together face to face. We are concerned here with the question of how the hexahedra may be decomposed into tetrahedra without introducing any new vertices. We consider two possible decompositions, in which each hexahedron breaks into five or six tetrahedra in a prescribed fashion. In both cases, we obtain simple verifiable criteria for the existence of a decomposition, by making use of elementary facts of graph theory and algebraic. topology. 1. INTRODUcnON A hexahedral mesh is a partition of a region in 3-space ~3 into (not necessarily regular) hexahedra which fit together face to face. We are concerned here with the question of how the hexahedra may be decomposed into tetrahedra without introduc ing any new vertices. There is one well known [1] way of decomposing a hexahedral mesh into non-overlapping tetrahedra which always works. Start by labelling the vertices 1,2,3, .... Then divide each face into two triangles by the diagonal containing the first vertex of the face. Next consider a hexahedron H with first vertex V. The three faces of H not containing V have already been divided up into a total of six triangles, so take each of these to be the base of a tetrahedron with apex V. -
Section 1000.00 Omnitopology
Table of Contents ● 1000.00 OMNITOPOLOGY ● 1001.00 Inherent Rationality of Omnidirectional Epistemology ■ 1001.10 Spherical Reference ❍ 1001.20 Field of Geodesic Event Relationships ❍ 1002.10 Omnidirectional Nucleus ❍ 1003.10 Isotropic-Vector-Matrix Reference ❍ 1004.10 An Omnisynergetic Coordinate System ❍ 1005.10 Inventory of Omnidirectional Intersystem Precessional Effects ❍ 1005.15 Volume and Area Progressions ■ 1005.20 Biospherical Patterns ■ 1005.30 Poisson Effect ■ 1005.40 Genetic Intercomplexity ■ 1005.50 Truth and Love: Linear and Embracing ■ 1005.60 Generalization and Polarization ■ 1005.611 Metabolic Generalizations ❍ 1006.10 Omnitopology Defined ■ 1006.20 Omnitopological Domains ■ 1006.30 Vector Equilibrium Involvement Domain ■ 1006.40 Cosmic System Eight-dimensionality ❍ 1007.10 Omnitopology Compared with Euler's Topology ❍ 1007.20 Invalidity of Plane Geometry ❍ 1008.10 Geodesic Spheres in Closest Packing ❍ 1009.00 Critical Proximity ■ 1009.10 Interference: You Really Can t Get There from Here ■ 1009.20 Magnitude of Independent Orbiting ■ 1009.30 Symmetrical Conformation of Flying-Star Teams ■ 1009.40 Models and Divinity ■ 1009.50 Acceleration ■ 1009.60 Hammer-Thrower ■ 1009.69 Comet ■ 1009.70 Orbital Escape from Earth s Critical-Proximity Programmability ■ 1009.80 Pea-Shooter Sling-Thrower. and Gyroscope: Gravity and Mass- Attraction ● 1010.00 Prime Volumes ■ 1010.10 Domain and Quantum ■ 1010.20 Nonnuclear Prime Structural Systems ❍ 1011.00 Omnitopology of Prime Volumes ■ 1011.10 Prime Enclosure ■ 1011.20 Hierarchy of Nuclear -
Dodecahedron
Dodecahedron Figure 1 Regular Dodecahedron vertex labeling using “120 Polyhedron” vertex labels. COPYRIGHT 2007, Robert W. Gray Page 1 of 9 Encyclopedia Polyhedra: Last Revision: July 8, 2007 DODECAHEDRON Topology: Vertices = 20 Edges = 30 Faces = 12 pentagons Lengths: 15+ ϕ = 1.618 033 989 2 EL ≡ Edge length of regular Dodecahedron. 43ϕ + FA = EL 1.538 841 769 EL ≡ Face altitude. 2 ϕ DFV = EL ≅ 0.850 650 808 EL 5 15+ 20 ϕ DFE = EL ≅ 0.688 190 960 EL 10 3 DVV = ϕ EL ≅ 1.401 258 538 EL 2 1 DVE = ϕ 2 EL ≅ 1.309 016 994 EL 2 711+ ϕ DVF = EL ≅ 1.113 516 364 EL 20 COPYRIGHT 2007, Robert W. Gray Page 2 of 9 Encyclopedia Polyhedra: Last Revision: July 8, 2007 DODECAHEDRON Areas: 15+ 20 ϕ 2 2 Area of one pentagonal face = EL ≅ 1.720 477 401 EL 4 2 2 Total face area = 31520+ ϕ EL ≅ 20.645 728 807 EL Volume: 47+ ϕ 3 3 Cubic measure volume equation = EL ≅ 7.663 118 961 EL 2 38( + 14ϕ) 3 3 Synergetics' Tetra-volume equation = EL ≅ 65.023 720 585 EL 2 Angles: Face Angles: All face angles are 108°. Sum of face angles = 6480° Central Angles: ⎛⎞35− All central angles are = 2arcsin ⎜⎟ ≅ 41.810 314 896° ⎜⎟6 ⎝⎠ Dihedral Angles: ⎛⎞2 ϕ 2 All dihedral angles are = 2arcsin ⎜⎟ ≅ 116.565 051 177° ⎝⎠43ϕ + COPYRIGHT 2007, Robert W. Gray Page 3 of 9 Encyclopedia Polyhedra: Last Revision: July 8, 2007 DODECAHEDRON Additional Angle Information: Note that Central Angle(Dodecahedron) + Dihedral Angle(Icosahedron) = 180° Central Angle(Icosahedron) + Dihedral Angle(Dodecahedron) = 180° which is the case for dual polyhedra.