DOCSLIB.ORG

BIOINSPIRED ORIGAMI: INFORMATION RETRIEVAL TECHNIQUES for DESIGN of FOLDABLE ENGINEERING APPLICATIONS a Dissertation by ELISSA M

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
BIOINSPIRED ORIGAMI: INFORMATION RETRIEVAL TECHNIQUES for DESIGN of FOLDABLE ENGINEERING APPLICATIONS a Dissertation by ELISSA M BIOINSPIRED ORIGAMI: INFORMATION RETRIEVAL TECHNIQUES FOR DESIGN OF FOLDABLE ENGINEERING APPLICATIONS A Dissertation by ELISSA MORRIS Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Chair of Committee, Daniel A. McAdams Committee Members, Richard Malak Douglas Allaire Michael Moreno Head of Department, Andres Polycarpou August 2019 Major Subject: Mechanical Engineering Copyright 2019 Elissa Morris ABSTRACT The science of folding has inspired and challenged scholars for decades. Origami, the art of folding paper, has led to the development of many foldable engineering solutions with applications in manufacturing, materials, and product design. Interestingly, three fundamental origami crease patterns are analogous to folding observed in nature. Numerous folding patterns, structures, and behaviors exist in nature that have not been considered for engineering solutions simply because they are not well-known or studied by designers. While research has shown applying biological solutions to engineering problems is significantly valuable, various challenges prevent the transfer of knowledge from biology to the engineering domain. One of those challenges is the retrieval of useful design inspiration. In this dissertation work, information retrieval techniques are employed to retrieve useful biological design solutions and a text-based search algorithm is developed to return passages where folding in nature is observed. The search algorithm, called FoldSearch, integrates tailored biological keywords and filtering methods to retrieve passages from an extensive biological corpus. The performance of FoldSearch is evaluated using statistical methods for information retrieval and validated using inter-rater reliability analysis. The utility of FoldSearch is demonstrated through two case studies where the retrieved biological examples undergo a design abstraction process that leads to the development of bioinspired origami crease patterns and novel foldable structures. The design abstraction process is presented as an additional research contribution and demonstrates the potential to provide bioinspired design solutions for the growing research field of origami engineering. ii DEDICATION For Jody, Jose, and Oliver iii ACKNOWLEDGEMENTS First and foremost, I want to thank Dr. Daniel A. McAdams for being my advisor. His support, patience, and humor have been a tremendous encouragement throughout my doctoral studies. The example of intellectual rigor and academic creativity that he has set will have a lasting impact on my professional career. I am immensely thankful and proud to have been his doctoral student. I want to express sincere gratitude to my committee members, Dr. Douglas Allaire, Dr. Richard Malak, and Dr. Michael Moreno, for their support in my doctoral studies and invaluable feedback on my dissertation research. I want to thank my lab mates – Shraddha Sangelkar, Sooyeon Lee, Joanna Tsenn, Jonel Ortiz, Shelby Hopkins, and Devesh Bhasin – for their friendship and encouragement. I especially want to thank Guanglu Zhang. His support, positivity, and academic aggressiveness have motivated me in more ways than he knows. I cannot truly express how indebted I am to my family. My parents have made significant sacrifices to provide me with opportunities in life that they never had. I am immensely thankful for their love, prayers, and encouragement. My husband has been my stronghold throughout my graduate career. I am certain that I couldn’t have finished my doctoral studies without his loving support. Finally, I want to thank my Savior and Truest Friend, Jesus Christ. Words fall short of expressing my gratitude for His guiding presence in my life. iv CONTRIBUTORS AND FUNDING SOURCES Contributors This work was supervised by a dissertation committee consisting of Professor Daniel A. McAdams, Professor Richard Malak, and Professor Douglas Allaire of the Department of Mechanical Engineering and Professor Michael Moreno of the Department of Biomedical Engineering. Jesse O’Connor and Dr. Jian Tao contributed to the early development phases of the search algorithm. Tanner Foster and Khristan-Allen Maney converted the corpus into searchable text files. Kaylee Kaigler provided assistance in the inter-rater reliability analysis. All other work conducted for the dissertation was completed by the author independently. Funding Sources Graduate study was supported by various Teaching Assistantships from the Mechanical Engineering Department at Texas A&M University and a Graduate Teaching Fellowship from the College of Engineering at Texas A&M University. This work was also made possible in part by National Science Foundation NSF EFRI- ODISSEI 1240483. Any opinions, findings, and conclusions or recommendations expressed in this dissertation are those of the author and do not necessarily reflect the views of the National Science Foundation. v TABLE OF CONTENTS Page ABSTRACT…………………………………………………………………………………… ii DEDICATION…………………………………………………………………………............ iii ACKNOWLEDGEMENTS…………………………………………………………………… iv CONTRIBUTORS AND FUNDING SOURCES …………………………………………….. v TABLE OF CONTENTS……………………………………………………………………… vi LIST OF FIGURES …………………………………………………………………………… ix LIST OF TABLES…………………………………………………………………………….. xiv 1. INTRODUCTION …………..……………………………………………………………… 1 1.1. Bioinspired Origami ……….………………………………………………..………… 1 1.1.1. Organization of the Dissertation ………..…..…………………………………..… 1 1.2. Origami Engineering ……………………………………………………….......……… 2 1.3. Bioinspired Design…………………………………………………………………….. 3 1.4. Information Retrieval ………………………………………………………………….. 4 1.5. Research Approach ……………………………………………………………………. 4 1.6. Case Studies …………………………………………………………………………… 5 1.7. Conclusions and Future Work …………………………………………….................... 5 2. ORIGAMI ENGINEERING AND PRODUCT DESIGN………………………………….. 7 2.1. Overview ………………………………………………………………………………. 7 2.2. Origami Product Design ……...……………………………………………..………… 7 2.2.1. Products Using Miura-ori Crease Pattern ……………………………………….. 10 2.2.2. Products Using Waterbomb Base Crease Pattern ………………………………… 14 2.2.3. Products Using Yoshimura Crease Pattern……………………………………….. 16 2.2.4. Products Using Less Common Crease Patterns…………………………………… 19 2.2.5. Products Using Simple Folding, Shape-Changing Schemes……………………… 26 2.2.6. Products Using Origami Aesthetics………………………………………………. 39 2.3. Overall Trends in Origami Engineering and Product Design …………………………. 41 2.4. Summary……………………………………………………………………………….. 44 3. BIOINSPIRED DESIGN…………………………………………………………………… 46 vi 3.1. Overview ………………………………………………………………………………. 46 3.2. Bioinspired Origami…………………………………………………………………… 46 3.2.1. Tree Leaves Analogous to Miura-ori Pattern …………………………………….. 47 3.2.2. Hawkmoth Analogous to Kresling Pattern ……………………………………….. 48 3.2.3. Pinecone-inspired Pineapple Pattern……………………………………………… 49 3.3. Summary……………………………………………………………………………..… 51 4. INFORMATION RETRIEVAL ……………………………………………………………. 52 4.1. Overview ………………………………………………………………………………. 52 4.2. Information Retrieval for Bioinspired Design ………………………………………… 52 4.3. Summary ………………………………………………………………………………. 53 5. RESEARCH APPROACH …………………………………………………………………. 55 5.1. Problem Identification and Motivation………………………………………………… 55 5.2. FoldSearch Development ……………………………………………………………… 56 5.2.1. Keyword Selection Procedures…………………………………………………… 56 5.2.2. Biological Corpus ………………………………………………………………… 67 5.2.3. Filtering Methods of Search Modes………………………………………………. 68 5.2.4. Readability ………………………………………………………………………... 76 5.2.5. Functionality ……………………………………………………………………… 77 5.3. FoldSearch Validation …………………………………………………………….…... 80 5.3.1. Inter-rater Reliability Analysis …………………………………………………… 80 5.3.2. Performance Comparison to Other Search Tools ………………………………… 82 5.4. Summary………………………………………..………………………………..…….. 83 6. CASE STUDIES …………………………………………………………………………… 85 6.1. Design Abstraction………………………………………..…………………………… 85 6.1.1. Existing Design Abstraction Processes for Bioinspired Origami………………… 86 6.2. Guidelines Used to Create Bioinspired Origami………………………………………. 89 6.2.1. Flat Foldability……………………………………………………………………. 90 6.2.2. Types of Symmetrical Repeats …………………………………………………… 92 6.3. Case Study: Tortoise Shell/Pangolin Scale-inspired Crease Pattern ………………….. 94 6.4. Case Study: Woodlouse-inspired Crease Pattern ……………………………………… 96 6.5. Generalized Bioinspired Origami Design Process Using FoldSearch ………………… 100 6.6. Summary………………………….…………………………………………….……… 101 7. RESEARCH CONTRIBUTIONS AND FUTURE WORK ……….………………………. 103 7.1. Research Contributions ……………….……………………………………………….. 103 7.2. Future Work …...…………………………………………………………………...….. 103 7.3. Conclusions…………………………………………………………………………….. 104 vii REFERENCES ………………………………………………………………………………... 106 APPENDIX A: FOLDSEARCH ALGORITHM …………………….……………………….. 120 viii LIST OF FIGURES Page Figure 2.1 Miura-ori crease pattern [18, 19]…………………………………………………... 10 Figure 2.2 Folded map design [19]……………………………………………………………. 11 Figure 2.3 (left) Two-dimensional deployable solar array, (right) Close view of array pattern [22]…………………………………………………………………………………….. 11 Figure 2.4 Folded and deployed states of sunshield prototype [23]…………………………… 12 Figure 2.5 Folding lithium-ion battery using Miura-ori crease pattern [7]……………………. 12 Figure 2.6 Origami-inspired deployable shroud for X-ray machine [27]……………………… 13 Figure 2.7 User interaction with tessella light [28] …………………………………………… 13 Figure 2.8 Petit Pli expandable children’s clothing [29] ………………………………………
Load more

Recommended publications
  • Mathematics of Origami
    Mathematics of Origami Angela Kohlhaas Loras College February 17, 2012 Introduction Origami ori + kami, “folding paper” Tools: one uncut square of paper, mountain and valley folds Goal: create art with elegance, balance, detail Outline History Applications Foldability Design History of Origami 105 A.D.: Invention of paper in China Paper-folding begins shortly after in China, Korea, Japan 800s: Japanese develop basic models for ceremonial folding 1200s: Origami globalized throughout Japan 1682: Earliest book to describe origami 1797: How to fold 1,000 cranes published 1954: Yoshizawa’s book formalizes a notational system 1940s-1960s: Origami popularized in the U.S. and throughout the world History of Origami Mathematics 1893: Geometric exercises in paper folding by Row 1936: Origami first analyzed according to axioms by Beloch 1989-present: Huzita-Hatori axioms Flat-folding theorems: Maekawa, Kawasaki, Justin, Hull TreeMaker designed by Lang Origami sekkei – “technical origami” Rigid origami Applications from the large to very small Miura-Ori Japanese solar sail “Eyeglass” space telescope Lawrence Livermore National Laboratory Science of the small Heart stents Titanium hydride printing DNA origami Protein-folding Two broad categories Foldability (discrete, computational complexity) Given a pattern of creases, when does the folded model lie flat? Design (geometry, optimization) How much detail can added to an origami model, and how efficiently can this be done? Flat-Foldability of Crease Patterns 훗 Three criteria for 훗: Continuity, Piecewise isometry, Noncrossing 2-Colorable Under the mapping 훗, some faces are flipped while others are only translated and rotated. Maekawa-Justin Theorem At any interior vertex, the number of mountain and valley folds differ by two.
    [Show full text]
  • A Survey of Folding and Unfolding in Computational Geometry
    Combinatorial and Computational Geometry MSRI Publications Volume 52, 2005 A Survey of Folding and Unfolding in Computational Geometry ERIK D. DEMAINE AND JOSEPH O’ROURKE Abstract. We survey results in a recent branch of computational geome- try: folding and unfolding of linkages, paper, and polyhedra. Contents 1. Introduction 168 2. Linkages 168 2.1. Definitions and fundamental questions 168 2.2. Fundamental questions in 2D 171 2.3. Fundamental questions in 3D 175 2.4. Fundamental questions in 4D and higher dimensions 181 2.5. Protein folding 181 3. Paper 183 3.1. Categorization 184 3.2. Origami design 185 3.3. Origami foldability 189 3.4. Flattening polyhedra 191 4. Polyhedra 193 4.1. Unfolding polyhedra 193 4.2. Folding polygons into convex polyhedra 196 4.3. Folding nets into nonconvex polyhedra 199 4.4. Continuously folding polyhedra 200 5. Conclusion and Higher Dimensions 201 Acknowledgements 202 References 202 Demaine was supported by NSF CAREER award CCF-0347776. O’Rourke was supported by NSF Distinguished Teaching Scholars award DUE-0123154. 167 168 ERIKD.DEMAINEANDJOSEPHO’ROURKE 1. Introduction Folding and unfolding problems have been implicit since Albrecht D¨urer [1525], but have not been studied extensively in the mathematical literature until re- cently. Over the past few years, there has been a surge of interest in these problems in discrete and computational geometry. This paper gives a brief sur- vey of most of the work in this area. Related, shorter surveys are [Connelly and Demaine 2004; Demaine 2001; Demaine and Demaine 2002; O’Rourke 2000]. We are currently preparing a monograph on the topic [Demaine and O’Rourke ≥ 2005].
    [Show full text]
  • GEOMETRIC FOLDING ALGORITHMS I
    P1: FYX/FYX P2: FYX 0521857570pre CUNY758/Demaine 0 521 81095 7 February 25, 2007 7:5 GEOMETRIC FOLDING ALGORITHMS Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500s but have only recently been studied in the mathemat- ical literature. Over the past decade, there has been a surge of interest in these problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this comprehensive treatment of the geometry of folding and unfolding presents hundreds of results and more than 60 unsolved “open prob- lems” to spur further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Among the results in Part I is that there is a planar linkage that can trace out any algebraic curve, even “sign your name.” Part II features the “fold-and-cut” algorithm, establishing that any straight-line drawing on paper can be folded so that the com- plete drawing can be cut out with one straight scissors cut. In Part III, readers will see that the “Latin cross” unfolding of a cube can be refolded to 23 different convex polyhedra. Aimed primarily at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high school students to researchers. Erik D. Demaine is the Esther and Harold E. Edgerton Professor of Elec- trical Engineering and Computer Science at the Massachusetts Institute of Technology, where he joined the faculty in 2001. He is the recipient of several awards, including a MacArthur Fellowship, a Sloan Fellowship, the Harold E.
    [Show full text]
  • Synthesis of Fast and Collision-Free Folding of Polyhedral Nets
    Synthesis of Fast and Collision-free Folding of Polyhedral Nets Yue Hao Yun-hyeong Kim Jyh-Ming Lien George Mason University Seoul National University George Mason University Fairfax, VA Seoul, South Korea Fairfax, VA [email protected] [email protected] [email protected] Figure 1: An optimized unfolding (top) created using our method and an arbitrary unfolding (bottom) for the fish mesh with 150 triangles (left). Each row shows the folding sequence by linearly interpolating the initial and target configurations. Self- intersecting faces, shown in red at bottom, result in failed folding. Additional results, foldable nets produced by the proposed method and an accompanied video are available on http://masc.cs.gmu.edu/wiki/LinearlyFoldableNets. ABSTRACT paper will provide a powerful tool to enable designers, materi- A predominant issue in the design and fabrication of highly non- als engineers, roboticists, to name just a few, to make physically convex polyhedral structures through self-folding, has been the conceivable structures through self-assembly by eliminating the collision of surfaces due to inadequate controls and the computa- common self-collision issue. It also simplifies the design of the tional complexity of folding-path planning. We propose a method control mechanisms when making deployable shape morphing de- that creates linearly foldable polyhedral nets, a kind of unfoldings vices. Additionally, our approach makes foldable papercraft more with linear collision-free folding paths. We combine the topolog- accessible to younger children and provides chances to enrich their ical and geometric features of polyhedral nets into a hypothesis education experiences. fitness function for a genetic-based unfolder and use it to mapthe polyhedral nets into a low dimensional space.
    [Show full text]
  • Continuous Blooming of Convex Polyhedra Erik D
    Masthead Logo Smith ScholarWorks Computer Science: Faculty Publications Computer Science 5-2011 Continuous Blooming of Convex Polyhedra Erik D. Demaine Massachusetts nI stitute of Technology Martin L. Demaine Massachusetts nI stitute of Technology Vi Hart Joan Iacono New York University Stefan Langerman Universite Libre de Bruxelles See next page for additional authors Follow this and additional works at: https://scholarworks.smith.edu/csc_facpubs Part of the Computer Sciences Commons, and the Discrete Mathematics and Combinatorics Commons Recommended Citation Demaine, Erik D.; Demaine, Martin L.; Hart, Vi; Iacono, Joan; Langerman, Stefan; and O'Rourke, Joseph, "Continuous Blooming of Convex Polyhedra" (2011). Computer Science: Faculty Publications, Smith College, Northampton, MA. https://scholarworks.smith.edu/csc_facpubs/31 This Article has been accepted for inclusion in Computer Science: Faculty Publications by an authorized administrator of Smith ScholarWorks. For more information, please contact [email protected] Authors Erik D. Demaine, Martin L. Demaine, Vi Hart, Joan Iacono, Stefan Langerman, and Joseph O'Rourke This article is available at Smith ScholarWorks: https://scholarworks.smith.edu/csc_facpubs/31 Continuous Blooming of Convex Polyhedra Erik D. Demaine∗† Martin L. Demaine∗ Vi Hart‡ John Iacono§ Stefan Langerman¶ Joseph O’Rourkek June 13, 2009 Abstract We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming. 1 Introduction A standard approach to building 3D surfaces from rigid sheet material, such as sheet metal or cardboard, is to design an unfolding: cuts on the 3D surface so that the remainder can unfold (along edge hinges) into a single flat non-self-overlapping piece.
    [Show full text]
  • © Cambridge University Press Cambridge
    Cambridge University Press 978-0-521-85757-4 - Geometric Folding Algorithms: Linkages, Origami, Polyhedra Erik D. Demaine and Joseph O’Rourke Index More information Index 1-skeleton, 311, 339 bar, 9 3-Satisfiability, 217, 221 base, see origami, base, 2 α-cone canonical configuration, 151, 152 Bauhaus, 294 α-producible chain, 150, 151 Bellows theorem, 279, 348 δ-perturbation, 115 bending λ order function, 176, 177, 186 machine, xi, 13, 306 antisymmetry condition, 177, 186 pipe, 13, 14 consistency condition, 178, 186 sheet metal, 306 noncrossing condition, 179, 186 beta sheet, 158 time continuity, 174, 183, 187 Bezdek, Daniel, 331 transitivity condition, 178, 186 blooming, continuous, 333, 435 bond angle, 14, 131, 148, 151 Abe’s angle trisection, 286, 287 bond length, 148 accordion, 85, 193, 200, 261 active path, 244, 245, 247–249 cable, 53–55 acyclicity, 108 CAD, see cylindrical algebraic decomposition, 19 additor (Kempe), 32, 34, 35 cage, 21, 92, 93 Alexandrov, Aleksandr D., 348 canonical form, 74, 86, 87, 141, 151 Alexandrov’s theorem, 339, 348, 349, 352, 354, Cauchy’s arm lemma, 72, 133, 143, 145, 342, 343, 368, 381, 393, 419 377 existence, 351 Cauchy’s rigidity theorem, 43, 143, 213, 279, 339, uniqueness, 350 341, 342, 345, 348–350, 354, 403 algebraic motion, 107, 111 Cauchy—Steinitz lemma, 72, 342 algebraic set, 39, 44 chain algebraic variety, 27 4D, 92, 93, 437 alpha helix, 151, 157, 158 abstract, 65, 149, 153, 158 Amato, Nancy, 157 convex, 143, 145 amino acid, 158 cutting, xi, 91, 123 amino acid residue, 14, 148, 151 equilateral, see
    [Show full text]
  • Marvelous Modular Origami
    www.ATIBOOK.ir Marvelous Modular Origami www.ATIBOOK.ir Mukerji_book.indd 1 8/13/2010 4:44:46 PM Jasmine Dodecahedron 1 (top) and 3 (bottom). (See pages 50 and 54.) www.ATIBOOK.ir Mukerji_book.indd 2 8/13/2010 4:44:49 PM Marvelous Modular Origami Meenakshi Mukerji A K Peters, Ltd. Natick, Massachusetts www.ATIBOOK.ir Mukerji_book.indd 3 8/13/2010 4:44:49 PM Editorial, Sales, and Customer Service Office A K Peters, Ltd. 5 Commonwealth Road, Suite 2C Natick, MA 01760 www.akpeters.com Copyright © 2007 by A K Peters, Ltd. All rights reserved. No part of the material protected by this copyright notice may be reproduced or utilized in any form, electronic or mechanical, including photo- copying, recording, or by any information storage and retrieval system, without written permission from the copyright owner. Library of Congress Cataloging-in-Publication Data Mukerji, Meenakshi, 1962– Marvelous modular origami / Meenakshi Mukerji. p. cm. Includes bibliographical references. ISBN 978-1-56881-316-5 (alk. paper) 1. Origami. I. Title. TT870.M82 2007 736΄.982--dc22 2006052457 ISBN-10 1-56881-316-3 Cover Photographs Front cover: Poinsettia Floral Ball. Back cover: Poinsettia Floral Ball (top) and Cosmos Ball Variation (bottom). Printed in India 14 13 12 11 10 10 9 8 7 6 5 4 3 2 www.ATIBOOK.ir Mukerji_book.indd 4 8/13/2010 4:44:50 PM To all who inspired me and to my parents www.ATIBOOK.ir Mukerji_book.indd 5 8/13/2010 4:44:50 PM www.ATIBOOK.ir Contents Preface ix Acknowledgments x Photo Credits x Platonic & Archimedean Solids xi Origami Basics xii
    [Show full text]
  • The Mathematics of Origami Thomas H
    The Mathematics of Origami Thomas H. Bertschinger, Joseph Slote, Olivia Claire Spencer, Samuel Vinitsky Contents 1 Origami Constructions 2 1.1 Axioms of Origami . .3 1.2 Lill's method . 12 2 General Foldability 14 2.1 Foldings and Knot Theory . 17 3 Flat Foldability 20 3.1 Single Vertex Conditions . 20 3.2 Multiple Vertex Crease Patterns . 23 4 Computational Folding Questions: An Overview 24 4.1 Basics of Algorithmic Analysis . 24 4.2 Introduction to Computational Complexity Theory . 26 4.3 Computational Complexity of Flat Foldability . 27 5 Map Folding: A Computational Problem 28 5.1 Introduction to Maps . 28 5.2 Testing the Validity of a Linear Ordering . 30 5.3 Complexity of Map Folding . 35 6 The Combinatorics of Flat Folding 38 6.1 Definition . 39 6.2 Winding Sequences . 41 6.3 Enumerating Simple Meanders . 48 6.4 Further Study . 58 The Mathematics of Origami Introduction Mention of the word \origami" might conjure up images of paper cranes and other representational folded paper forms, a child's pasttime, or an art form. At first thought it would appear there is little to be said about the mathematics of what is by some approximation merely crumpled paper. Yet there is a surprising amount of conceptual richness to be teased out from between the folds of these paper models. Even though researchers are just at the cusp of understanding the theoretical underpinnings of this an- cient art form, many intriguing applications have arisen|in areas as diverse as satellite deployment and internal medicine. Parallel to the development of these applications, mathematicians have begun to seek descriptions of the capabilities and limitations of origami in a more abstract sense.
    [Show full text]
  • Modeling and Simulation for Foldable Tsunami Pod
    明治大学大学院先端数理科学研究科 2015 年 度 博士学位請求論文 Modeling and Simulation for Foldable Tsunami Pod 折り畳み可能な津波ポッドのためのモデリングとシミュレーション 学位請求者 現象数理学専攻 中山 江利 Modeling and Simulation for Foldable Tsunami Pod 折り畳み可能な津波ポッドのためのモデリングとシミュレーション A Dissertation Submitted to the Graduate School of Advanced Mathematical Sciences of Meiji University by Department of Advanced Mathematical Sciences, Meiji University Eri NAKAYAMA 中山 江利 Supervisor: Professor Dr. Ichiro Hagiwara January 2016 Abstract Origami has been attracting attention from the world, however it is not long since applying it into industry is intended. For the realization, not only mathematical understanding origami mathematically but also high level computational science is necessary to apply origami into industry. Since Tohoku earthquake on March 11, 2011, how to ensure oneself against danger of tsunami is a major concern around the world, especially in Japan. And, there have been several kinds of commercial products for a tsunami shelter developed and sold. However, they are very large and take space during normal period, therefore I develop an ellipsoid formed tsunami pod which is smaller and folded flat which is stored ordinarily and deployed in case of tsunami arrival. It is named as “tsunami pod”, because its form looks like a shell wrapping beans. Firstly, I verify the stiffness of the tsunami pod and the injury degree of an occupant. By using von Mises equivalent stress to examine the former and Head injury criterion for the latter, it is found that in case of the initial model where an occupant is not fastened, he or she would suffer from serious injuries. Thus, an occupant restraint system imitating the safety bars for a roller coaster is developed and implemented into the tsunami pod.
    [Show full text]
  • On Rigid Origami I: Piecewise-Planar Paper with Straight-Line Creases
    On Rigid Origami I: Piecewise-planar Paper with Straight-line Creases Zeyuan He, Simon D. Guest∗ January 5, 2021 Abstract We develop a theoretical framework for rigid origami, and show how this framework can be used to connect rigid origami and results from cognate areas, such as the rigidity theory, graph theory, linkage folding and computer science. First, we give definitions on important concepts in rigid origami, then focus on how to describe the configuration space of a creased paper. The shape and 0-connectedness of the configuration space are analysed using algebraic, geometric and numeric methods, where the key results from each method are gathered and reviewed. Keywords: rigid-foldability, folding, configuration 1 Introduction This article develops a general theoretical framework for rigid origami, and uses this to gather and review the progress that researchers have made on the theory of rigid origami, including other related areas, such as rigidity theory, graph theory, linkage folding, and computer science. Origami has been used for many different physical models, as a recent review [1] shows. Sometimes a "rigid" origami model is required where all the deforma- tion is concentrated on the creases. A rigid origami model is usually considered to be a system of rigid panels that are able to rotate around their common boundaries and has been applied to many areas across different length scales [2]. These successful applications have inspired us to focus on the fundamental theory of rigid origami. Ultimately, we are considering two problems: first, the positive problem, which is to find useful sufficient and necessary conditions for a creased paper to be rigid-foldable; second, the inverse problem, which is to approximate a target surface by rigid origami.
    [Show full text]
  • Arxiv:Math/0312253V1 [Math.MG] 12 Dec 2003 Contents ∗ † .Oe Rbesadcmlxt Sus41 35 Issues Complexity and Problems Open History 9
    METRIC COMBINATORICS OF CONVEX POLYHEDRA: CUT LOCI AND NONOVERLAPPING UNFOLDINGS EZRA MILLER∗ AND IGOR PAK† Abstract. Let S be the boundary of a convex polytope of dimension d +1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfolding into Rd, so the metric space S is obtained from a closed (usually nonconvex) polyhedral ball in Rd by identifying pairs of boundary faces isometrically. Our existence proof exploits geodesic flow away from a source point v S, which is the exponential map to S from the tangent space at v. We characterize∈ the cut locus (the closure of the set of points in S with more than one shortest path to v) as a polyhedral complex in terms of Voronoi diagrams on facets. Analyzing infinitesimal expansion of the wavefront consisting of points at constant distance from v on S produces an algorithmic method for constructing Voronoi diagrams in each facet, and hence the unfolding of S. The algorithm, for which we provide pseudocode, solves the discrete geodesic problem. Its main construction generalizes the source unfolding for boundaries of 3-polytopes into R2. We present conjectures concerning the number of shortest paths on the boundaries of convex polyhedra, and concerning continuous unfolding of convex polyhedra. We also comment on the intrinsic non-polynomial complexity of nonconvex manifolds. Contents Introduction 2 Overview 2 Methods 4 1. Geodesics in polyhedral boundaries 7 2. Cut loci 10 3. Polyhedral nonoverlapping unfolding 15 4. The source poset 17 arXiv:math/0312253v1 [math.MG] 12 Dec 2003 5.
    [Show full text]
  • Map Folding by Rahnuma Islam Nishat B.Sc.Engg., Bangladesh
    Map Folding by Rahnuma Islam Nishat B.Sc.Engg., Bangladesh University of Engineering and Technology, 2009 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE in the Department of Computer Science c Rahnuma Islam Nishat, 2013 University of Victoria All rights reserved. This thesis may not be reproduced in whole or in part, by photocopying or other means, without the permission of the author. ii Map Folding by Rahnuma Islam Nishat B.Sc.Engg., Bangladesh University of Engineering and Technology, 2009 Supervisory Committee Dr. Sue Whitesides, Supervisor (Department of Computer Science) Dr. Frank Ruskey, Departmental Member (Department of Computer Science) iii Supervisory Committee Dr. Sue Whitesides, Supervisor (Department of Computer Science) Dr. Frank Ruskey, Departmental Member (Department of Computer Science) ABSTRACT A crease pattern is an embedded planar graph on a piece of paper. An m×n map is a rectangular piece of paper with a crease pattern that partitions the paper into an m×n regular grid of unit squares. If a map has a configuration such that all the faces of the map are stacked on a unit square and the paper does not self-intersect, then it is flat foldable, and the linear ordering of the faces is called a valid linear ordering. Otherwise, the map is unfoldable. In this thesis, we show that, given a linear ordering of the faces of an m × n map, we can decide in linear time whether it is a valid linear ordering or not. We also define a class of unfoldable 2 × n crease patterns for every n ≥ 5.
    [Show full text]