Spiral Unfoldings of Convex Polyhedra
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
On the Circuit Diameter Conjecture
On the Circuit Diameter Conjecture Steffen Borgwardt1, Tamon Stephen2, and Timothy Yusun2 1 University of Colorado Denver [email protected] 2 Simon Fraser University {tamon,tyusun}@sfu.ca Abstract. From the point of view of optimization, a critical issue is relating the combina- torial diameter of a polyhedron to its number of facets f and dimension d. In the seminal paper of Klee and Walkup [KW67], the Hirsch conjecture of an upper bound of f − d was shown to be equivalent to several seemingly simpler statements, and was disproved for unbounded polyhedra through the construction of a particular 4-dimensional polyhedron U4 with 8 facets. The Hirsch bound for bounded polyhedra was only recently disproved by Santos [San12]. We consider analogous properties for a variant of the combinatorial diameter called the circuit diameter. In this variant, the walks are built from the circuit directions of the poly- hedron, which are the minimal non-trivial solutions to the system defining the polyhedron. We are able to prove that circuit variants of the so-called non-revisiting conjecture and d-step conjecture both imply the circuit analogue of the Hirsch conjecture. For the equiva- lences in [KW67], the wedge construction was a fundamental proof technique. We exhibit why it is not available in the circuit setting, and what are the implications of losing it as a tool. Further, we show the circuit analogue of the non-revisiting conjecture implies a linear bound on the circuit diameter of all unbounded polyhedra – in contrast to what is known for the combinatorial diameter. Finally, we give two proofs of a circuit version of the 4-step conjecture. -
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). -
Cons=Ucticn (Process)
DOCUMENT RESUME ED 038 271 SE 007 847 AUTHOR Wenninger, Magnus J. TITLE Polyhedron Models for the Classroom. INSTITUTION National Council of Teachers of Mathematics, Inc., Washington, D.C. PUB DATE 68 NOTE 47p. AVAILABLE FROM National Council of Teachers of Mathematics,1201 16th St., N.V., Washington, D.C. 20036 ED RS PRICE EDRS Pr:ce NF -$0.25 HC Not Available from EDRS. DESCRIPTORS *Cons=ucticn (Process), *Geometric Concepts, *Geometry, *Instructional MateriAls,Mathematical Enrichment, Mathematical Models, Mathematics Materials IDENTIFIERS National Council of Teachers of Mathematics ABSTRACT This booklet explains the historical backgroundand construction techniques for various sets of uniformpolyhedra. The author indicates that the practical sianificanceof the constructions arises in illustrations for the ideas of symmetry,reflection, rotation, translation, group theory and topology.Details for constructing hollow paper models are provided for thefive Platonic solids, miscellaneous irregular polyhedra and somecompounds arising from the stellation process. (RS) PR WON WITHMICROFICHE AND PUBLISHER'SPRICES. MICROFICHEREPRODUCTION f ONLY. '..0.`rag let-7j... ow/A U.S. MOM Of NUM. INCIII01 a WWII WIC Of MAW us num us us ammo taco as mums NON at Ot Widel/A11011 01116111111 IT.P01115 OF VOW 01 OPENS SIAS SO 101 IIKISAMIT IMRE Offlaat WC Of MANN POMO OS POW. OD PROCESS WITH MICROFICHE AND PUBLISHER'S PRICES. reit WeROFICHE REPRODUCTION Pvim ONLY. (%1 00 O O POLYHEDRON MODELS for the Classroom MAGNUS J. WENNINGER St. Augustine's College Nassau, Bahama. rn ErNATIONAL COUNCIL. OF Ka TEACHERS OF MATHEMATICS 1201 Sixteenth Street, N.W., Washington, D. C. 20036 ivetmIssromrrIPRODUCE TmscortnIGMED Al"..Mt IAL BY MICROFICHE ONLY HAS IEEE rano By Mat __Comic _ TeachMar 10 ERIC MID ORGANIZATIONS OPERATING UNSER AGREEMENTS WHIM U. -
The Truncated Icosahedron As an Inflatable Ball
https://doi.org/10.3311/PPar.12375 Creative Commons Attribution b |99 Periodica Polytechnica Architecture, 49(2), pp. 99–108, 2018 The Truncated Icosahedron as an Inflatable Ball Tibor Tarnai1, András Lengyel1* 1 Department of Structural Mechanics, Faculty of Civil Engineering, Budapest University of Technology and Economics, H-1521 Budapest, P.O.B. 91, Hungary * Corresponding author, e-mail: [email protected] Received: 09 April 2018, Accepted: 20 June 2018, Published online: 29 October 2018 Abstract In the late 1930s, an inflatable truncated icosahedral beach-ball was made such that its hexagonal faces were coloured with five different colours. This ball was an unnoticed invention. It appeared more than twenty years earlier than the first truncated icosahedral soccer ball. In connection with the colouring of this beach-ball, the present paper investigates the following problem: How many colourings of the dodecahedron with five colours exist such that all vertices of each face are coloured differently? The paper shows that four ways of colouring exist and refers to other colouring problems, pointing out a defect in the colouring of the original beach-ball. Keywords polyhedron, truncated icosahedron, compound of five tetrahedra, colouring of polyhedra, permutation, inflatable ball 1 Introduction Spherical forms play an important role in different fields – not even among the relics of the Romans who inherited of science and technology, and in different areas of every- many ball games from the Greeks. day life. For example, spherical domes are quite com- The Romans mainly used balls composed of equal mon in architecture, and spherical balls are used in most digonal panels, forming a regular hosohedron (Coxeter, 1973, ball games. -
Decomposing Deltahedra
Decomposing Deltahedra Eva Knoll EK Design ([email protected]) Abstract Deltahedra are polyhedra with all equilateral triangular faces of the same size. We consider a class of we will call ‘regular’ deltahedra which possess the icosahedral rotational symmetry group and have either six or five triangles meeting at each vertex. Some, but not all of this class can be generated using operations of subdivision, stellation and truncation on the platonic solids. We develop a method of generating and classifying all deltahedra in this class using the idea of a generating vector on a triangular grid that is made into the net of the deltahedron. We observed and proved a geometric property of the length of these generating vectors and the surface area of the corresponding deltahedra. A consequence of this is that all deltahedra in our class have an integer multiple of 20 faces, starting with the icosahedron which has the minimum of 20 faces. Introduction The Japanese art of paper folding traditionally uses square or sometimes rectangular paper. The geometric styles such as modular Origami [4] reflect that paradigm in that the folds are determined by the geometry of the paper (the diagonals and bisectors of existing angles and lines). Using circular paper creates a completely different design structure. The fact that chords of radial length subdivide the circumference exactly 6 times allows the use of a 60 degree grid system [5]. This makes circular Origami a great tool to experiment with deltahedra (Deltahedra are polyhedra bound by equilateral triangles exclusively [3], [8]). After the barn-raising of an endo-pentakis icosi-dodecahedron (an 80 faced regular deltahedron) [Knoll & Morgan, 1999], an investigation of related deltahedra ensued. -
New Perspectives on Polyhedral Molecules and Their Crystal Structures Santiago Alvarez, Jorge Echeverria
New Perspectives on Polyhedral Molecules and their Crystal Structures Santiago Alvarez, Jorge Echeverria To cite this version: Santiago Alvarez, Jorge Echeverria. New Perspectives on Polyhedral Molecules and their Crystal Structures. Journal of Physical Organic Chemistry, Wiley, 2010, 23 (11), pp.1080. 10.1002/poc.1735. hal-00589441 HAL Id: hal-00589441 https://hal.archives-ouvertes.fr/hal-00589441 Submitted on 29 Apr 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Journal of Physical Organic Chemistry New Perspectives on Polyhedral Molecules and their Crystal Structures For Peer Review Journal: Journal of Physical Organic Chemistry Manuscript ID: POC-09-0305.R1 Wiley - Manuscript type: Research Article Date Submitted by the 06-Apr-2010 Author: Complete List of Authors: Alvarez, Santiago; Universitat de Barcelona, Departament de Quimica Inorganica Echeverria, Jorge; Universitat de Barcelona, Departament de Quimica Inorganica continuous shape measures, stereochemistry, shape maps, Keywords: polyhedranes http://mc.manuscriptcentral.com/poc Page 1 of 20 Journal of Physical Organic Chemistry 1 2 3 4 5 6 7 8 9 10 New Perspectives on Polyhedral Molecules and their Crystal Structures 11 12 Santiago Alvarez, Jorge Echeverría 13 14 15 Departament de Química Inorgànica and Institut de Química Teòrica i Computacional, 16 Universitat de Barcelona, Martí i Franquès 1-11, 08028 Barcelona (Spain). -
Upper Bound on the Packing Density of Regular Tetrahedra and Octahedra
Upper bound on the packing density of regular tetrahedra and octahedra Simon Gravel Veit Elser and Yoav Kallus Department of Genetics Laboratory of Atomic and Solid State Physics Stanford University School of Medicine Cornell University Stanford, California, 94305-5120 Ithaca, NY 14853-2501 Abstract We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is not fully covered by the packing. The bound on the amount of space that is not covered in each sphere is obtained in a recursive way by building on the observation that non-overlapping regular tetrahedra cannot subtend a solid angle of 4π around a point if this point lies on a tetrahedron edge. The proof can be readily modified to apply to other polyhedra with the same property. The resulting lower bound on the fraction of empty space in a packing of regular tetrahedra is 2:6 ::: × 10−25 and reaches 1:4 ::: × 10−12 for regular octahedra. 1 Introduction The problem of finding dense arrangements of non-overlapping objects, also known as the packing prob- lem, holds a long and eventful history and holds fundamental interest in mathematics, physics, and computer science. Some instances of the packing problem rank among the longest-standing open problems in mathe- matics. The archetypal difficult packing problem is to find the arrangements of non-overlapping, identical balls that fill up the greatest volume fraction of space. The face-centered cubic lattice was conjectured to realize the highest packing fraction by Kepler, in 1611, but it was not until 1998 that this conjecture was established arXiv:1008.2830v1 [math.MG] 17 Aug 2010 using a computer-assisted proof [1] (as of March 2009, work was still in progress to “provide a greater level of certification of the correctness of the computer code and other details of the proof” [2]) . -
Triangulations and Simplex Tilings of Polyhedra
Triangulations and Simplex Tilings of Polyhedra by Braxton Carrigan A dissertation submitted to the Graduate Faculty of Auburn University in partial fulfillment of the requirements for the Degree of Doctor of Philosophy Auburn, Alabama August 4, 2012 Keywords: triangulation, tiling, tetrahedralization Copyright 2012 by Braxton Carrigan Approved by Andras Bezdek, Chair, Professor of Mathematics Krystyna Kuperberg, Professor of Mathematics Wlodzimierz Kuperberg, Professor of Mathematics Chris Rodger, Don Logan Endowed Chair of Mathematics Abstract This dissertation summarizes my research in the area of Discrete Geometry. The par- ticular problems of Discrete Geometry discussed in this dissertation are concerned with partitioning three dimensional polyhedra into tetrahedra. The most widely used partition of a polyhedra is triangulation, where a polyhedron is broken into a set of convex polyhedra all with four vertices, called tetrahedra, joined together in a face-to-face manner. If one does not require that the tetrahedra to meet along common faces, then we say that the partition is a tiling. Many of the algorithmic implementations in the field of Computational Geometry are dependent on the results of triangulation. For example computing the volume of a polyhedron is done by adding volumes of tetrahedra of a triangulation. In Chapter 2 we will provide a brief history of triangulation and present a number of known non-triangulable polyhedra. In this dissertation we will particularly address non-triangulable polyhedra. Our research was motivated by a recent paper of J. Rambau [20], who showed that a nonconvex twisted prisms cannot be triangulated. As in algebra when proving a number is not divisible by 2012 one may show it is not divisible by 2, we will revisit Rambau's results and show a new shorter proof that the twisted prism is non-triangulable by proving it is non-tilable. -
Paper Models of Polyhedra
Paper Models of Polyhedra Gijs Korthals Altes Polyhedra are beautiful 3-D geometrical figures that have fascinated philosophers, mathematicians and artists for millennia Copyrights © 1998-2001 Gijs.Korthals Altes All rights reserved . It's permitted to make copies for non-commercial purposes only email: [email protected] Paper Models of Polyhedra Platonic Solids Dodecahedron Cube and Tetrahedron Octahedron Icosahedron Archimedean Solids Cuboctahedron Icosidodecahedron Truncated Tetrahedron Truncated Octahedron Truncated Cube Truncated Icosahedron (soccer ball) Truncated dodecahedron Rhombicuboctahedron Truncated Cuboctahedron Rhombicosidodecahedron Truncated Icosidodecahedron Snub Cube Snub Dodecahedron Kepler-Poinsot Polyhedra Great Stellated Dodecahedron Small Stellated Dodecahedron Great Icosahedron Great Dodecahedron Other Uniform Polyhedra Tetrahemihexahedron Octahemioctahedron Cubohemioctahedron Small Rhombihexahedron Small Rhombidodecahedron S mall Dodecahemiododecahedron Small Ditrigonal Icosidodecahedron Great Dodecahedron Compounds Stella Octangula Compound of Cube and Octahedron Compound of Dodecahedron and Icosahedron Compound of Two Cubes Compound of Three Cubes Compound of Five Cubes Compound of Five Octahedra Compound of Five Tetrahedra Compound of Truncated Icosahedron and Pentakisdodecahedron Other Polyhedra Pentagonal Hexecontahedron Pentagonalconsitetrahedron Pyramid Pentagonal Pyramid Decahedron Rhombic Dodecahedron Great Rhombihexacron Pentagonal Dipyramid Pentakisdodecahedron Small Triakisoctahedron Small Triambic -
Wythoffian Skeletal Polyhedra
Wythoffian Skeletal Polyhedra by Abigail Williams B.S. in Mathematics, Bates College M.S. in Mathematics, Northeastern University A dissertation submitted to The Faculty of the College of Science of Northeastern University in partial fulfillment of the requirements for the degree of Doctor of Philosophy April 14, 2015 Dissertation directed by Egon Schulte Professor of Mathematics Dedication I would like to dedicate this dissertation to my Meme. She has always been my loudest cheerleader and has supported me in all that I have done. Thank you, Meme. ii Abstract of Dissertation Wythoff's construction can be used to generate new polyhedra from the symmetry groups of the regular polyhedra. In this dissertation we examine all polyhedra that can be generated through this construction from the 48 regular polyhedra. We also examine when the construction produces uniform polyhedra and then discuss other methods for finding uniform polyhedra. iii Acknowledgements I would like to start by thanking Professor Schulte for all of the guidance he has provided me over the last few years. He has given me interesting articles to read, provided invaluable commentary on this thesis, had many helpful and insightful discussions with me about my work, and invited me to wonderful conferences. I truly cannot thank him enough for all of his help. I am also very thankful to my committee members for their time and attention. Additionally, I want to thank my family and friends who, for years, have supported me and pretended to care everytime I start talking about math. Finally, I want to thank my husband, Keith. -
Operation-Based Notation for Archimedean Graph
Operation-Based Notation for Archimedean Graph Hidetoshi Nonaka Research Group of Mathematical Information Science Division of Computer Science, Hokkaido University N14W9, Sapporo, 060 0814, Japan ABSTRACT Table 1. The list of Archimedean solids, where p, q, r are the number of vertices, edges, and faces, respectively. We introduce three graph operations corresponding to Symbol Name of polyhedron p q r polyhedral operations. By applying these operations, thirteen Archimedean graphs can be generated from Platonic graphs that A(3⋅4)2 Cuboctahedron 12 24 14 are used as seed graphs. A4610⋅⋅ Great Rhombicosidodecahedron 120 180 62 A468⋅⋅ Great Rhombicuboctahedron 48 72 26 Keyword: Archimedean graph, Polyhedral graph, Polyhedron A 2 Icosidodecahedron 30 60 32 notation, Graph operation. (3⋅ 5) A3454⋅⋅⋅ Small Rhombicosidodecahedron 60 120 62 1. INTRODUCTION A3⋅43 Small Rhombicuboctahedron 24 48 26 A34 ⋅4 Snub Cube 24 60 38 Archimedean graph is a simple planar graph isomorphic to the A354 ⋅ Snub Dodecahedron 60 150 92 skeleton or wire-frame of the Archimedean solid. There are A38⋅ 2 Truncated Cube 24 36 14 thirteen Archimedean solids, which are semi-regular polyhedra A3⋅102 Truncated Dodecahedron 60 90 32 and the subset of uniform polyhedra. Seven of them can be A56⋅ 2 Truncated Icosahedron 60 90 32 formed by truncation of Platonic solids, and all of them can be A 2 Truncated Octahedron 24 36 14 formed by polyhedral operations defined as Conway polyhedron 4⋅6 A 2 Truncated Tetrahedron 12 18 8 notation [1-2]. 36⋅ The author has recently developed an interactive modeling system of uniform polyhedra including Platonic solids, Archimedean solids and Kepler-Poinsot solids, based on graph drawing and simulated elasticity, mainly for educational purpose [3-5]. -
Polyhedra from Symmetric Placement of Regular Polygons
Symmetrohedra: Polyhedra from Symmetric Placement of Regular Polygons Craig S. Kaplan George W. Hart University of Washington http://www.georgehart.com Box 352350, Seattle, WA 98195 USA [email protected] [email protected] Abstract In the quest for new visually interesting polyhedra with regular faces, we define and present an infinite class of solids, constructed by placing regular polygons at the rotational axes of a polyhedral symmetry group. This new technique can be used to generate many existing polyhedra, including most of the Archimedean solids. It also yields novel families of attractive symmetric polyhedra. 1 Introduction Most interesting polyhedra arise via a process that attempts to generate or preserve some measure of order. We might ask that the polyhedron be as symmetric as possible, that the symmetries act transitively on its vertices, edges or faces, or that all its faces be regular polygons. Indeed, these questions have all been asked and the resulting families of polyhedra enumerated to satisfaction. The last case, that of convex polyhedra all of whose faces are regular polygons, are the well-known Johnson solids [3]. Eager to discover new polyhedra with regular faces, but aware that the list of Johnson solids has been proven complete, we are faced with the prospect of letting some constraints slip a bit in order to innovate. We achieve this innovation by dropping the constraint that all faces be regular, asking only that many faces be regular, and that the remaining faces occur in a small number of different shapes. In this paper we define an infinite set of convex polyhedra that we call symmetrohedra.Theyare parameterized by several discrete and continuous values.