Journal Of Mechanical Design. Received September 29, 2018 .

3y ago
39 Views
2 Downloads
1.34 MB
22 Pages
Last View : 7d ago
Last Download : 3m ago
Upload by : Adele Mcdaniel
Transcription

Journal of Mechanical Design. Received September 29, 2018;Accepted manuscript posted January 17, 2019. doi:10.1115/1.4042791Copyright 2019 by ASMEAn integrated geometric-graph-theoretic approach to representing origamistructures and their corresponding truss frameworksYao Chen, Ph. D.1; Pooya Sareh, Ph. D.2; Jiayi Yan3; Arash S. Fallah, Ph. D.4; Jian Feng, Ph. D.5dAbstract: Origami has provided various interesting applications in science and engineering. Appropriateterepresentations and evaluation on crease patterns play an important role in developing an innovative origamiyedistructure with desired characteristics. However, this is generally a challenge encountered by scientists andCopengineers who introduce origami into various fields. As most practical origami structures contain repeated unitcells, graph products provide a suitable choice for the formation of crease patterns. Here, we will employotundirected and directed graph products as a tool for the representation of crease patterns and their correspondingtNtruss frameworks of origami structures. Given that an origami crease pattern can be considered to be a set ofripdirectionless crease lines which satisfy the foldability condition, we demonstrate that the pattern can be exactlyscexpressed by a specific graph product of independent graphs. It turns out that this integratedManugeometric-graph-theoretic method can be effectively implemented in the formation of different crease patterns,and provide suitable numbering of nodes and elements. Furthermore, the presented method is useful inconstructing the involved matrices and models of origami structures, and thus enhances configuration processingceptedfor geometric, kinematic or mechanical analysis on origami structures.Keywords: origami pattern; directed graph; origami structures; repetitive fold pattern; pin-jointed structures;graph theoryAc1 Associate Professor, Key Laboratory of Concrete and Prestressed Concrete Structures of Ministry of Education,and National Prestress Engineering Research Center, Southeast University, Nanjing 211189, China. Email:chenyao@seu.edu.cn2 Creative Design Engineering Lab, Division of Industrial Design, Faculty of Engineering, University ofLiverpool, London Campus, EC2A 1AG, UK. Email: pooya.sareh@livepool.ac.uk3 School of Civil Engineering, Southeast University, Nanjing 211189, China.4 Aeronautics Department, Imperial College London, South Kensington Campus, SW7 2AZ, UK.5 Professor, National Prestress Engineering Research Center, and Key Laboratory of Concrete and PrestressedConcrete Structures of Ministry of Education, Southeast University, Nanjing 211189, China. (correspondingauthor). Email: fengjian@seu.edu.cnDownloaded From: e.org on 02/07/2019 Terms of Use: http://www.asme.org/about-asme/terms-of-use

Journal of Mechanical Design. Received September 29, 2018;Accepted manuscript posted January 17, 2019. doi:10.1115/1.4042791Copyright 2019 by ASMEIntroductionOrigami is the art of folding 2D materials, such as a flat sheet of paper, into 3D objects with desired shapes.Since early 1980s, origami has evolved into a fertile scientific field connecting diverse disciplines, creating andenormous variety of new designs with various applications. In recent years, innovative engineering research andtemathematical studies have promoted the rapid development of origami as an emerging research field. Inyediparticular, the interesting mechanical properties of origami structures have attracted the interest ofCopmathematicians, engineers and scientists [1-5]. For instance, the structural stiffness and geometric shape-shiftingproperties of some origami structures have attracted considerable attention, be it in fashion, architecture,otmedicine, or engineering, from airbags to flexible electronics to deployable space structures [1, 6, 7]. NotabletNtheoretical progress has been made in the fields related to origami including tree theory, computational origamiriptheory, optimization methods for rigid origami, and geometric mechanics of origami structures [8].scRecently, using origami techniques, reprogrammable structures have been developed from 2D sheets throughManufolding along well-designed creases. A significant advantage of origami-inspired structures is enhancedflexibility in performance, because their properties are neatly coupled to an alterable crease pattern [3].Origami-inspired structures with the periodic Miura pattern and the non-periodic Resch pattern have beenceptedstudied [9]. It has been shown that the Miura fold pattern has a negative in-plane Poisson’s ratio. Wei et al. [8]have shown that the in-plane and out-of-plane Poisson’s ratios are equal in magnitude, but opposite in sign,Acindependent of material properties. In addition, the strong load bearing capability of the Resch pattern has beendemonstrated and attributed to the unique way of folding. Kuribayashi et al. [10] introduced the six-fold origamipattern into biomedical engineering and proposed an origami-inspired stent graft. Hunt et al. [11] studied thebuckling mechanism of a thin cylindrical shell under torsion and presented origami patterns with twist buckling.Also, they investigated the critical buckling loads and buckling mechanisms of the equivalent truss models.Downloaded From: e.org on 02/07/2019 Terms of Use: http://www.asme.org/about-asme/terms-of-use

Journal of Mechanical Design. Received September 29, 2018;Accepted manuscript posted January 17, 2019. doi:10.1115/1.4042791Copyright 2019 by ASMEIt is worth noting that, either designing a new pattern or investigating specific features of these origami-inspiredstructures, modeling and involved analysis on the structures are necessary. Thus, configuration processing (orpre-processing) for origami structures is important. Nevertheless, during geometric, kinematic or mechanicaldanalysis, the configuration processing for a large-scale structure is usually tedious and time-consuming. Limitedtestudies have been presented for providing powerful and integrated configuration processing methods for theseyediinnovative structures. Kaveh and Koohestani [12, 13] have developed graph-theoretical methods for theCopformation of structural configurations and numerical models. Thereafter, a submodel could be expressed inalgebraic forms and different functions could be utilized for the formation of the entire structural model, whereotthe functions mainly contain rotations, translations, reflections and projections, or a combination of thesetNoperations. Because many properties of original models can be evaluated by considering those of theirripsubmodels (or generators), complex computations can be greatly simplified [14, 15]. As most practical origamiscstructures contain repeated unit cells, graph products provide a suitable choice for the formation of creaseManupatterns and structural models. The degree-4 rigid origami known as the Miura pattern is a classic flat-foldabletessellation which retains a single degree-of-freedom during the folding process. In fact, the secret of theintriguing properties of a folded origami model largely relies on the design of an appropriate crease pattern onceptedthe 2D sheet. However, most geometric parameters such as coordinates of the vertices, angles between edge linesand the lengths of edges, which are not important in graph theory, have not been integrated into a conventionalAcgraph-theoretic approach. On the contrary, these geometric parameters are very important in the developability,flat-foldability, or rigid-foldability of an origami pattern, and thus they should be somehow incorporated.Here, an integrated geometric-graph-theoretic framework will be proposed for origami patterns and theircorresponding truss frameworks, to include both geometry and connectivity in the mathematical notation. Asignificance of this work is that we employ some undirected and directed graph products to represent creaseDownloaded From: e.org on 02/07/2019 Terms of Use: http://www.asme.org/about-asme/terms-of-use

Journal of Mechanical Design. Received September 29, 2018;Accepted manuscript posted January 17, 2019. doi:10.1115/1.4042791Copyright 2019 by ASMEpatterns of origami structures and equivalent pin-jointed structures, to enhance configuration processing forgeometric, kinematic or mechanical analysis on origami structures. The weights of nodes and edge lines assignedto the subgraphs are used to describe the geometric configuration of the origami patterns. Appropriate elementdordering and nodal numbering, and efficient computations and expressions for involved matrices of the origamitestructures can be obtained using this geometric-graph-theoretic approach.yediThe content of this work is as follows. Section 2 describes different types of graph products for representingCopcrease patterns. Then, in Section 3, a series of origami patterns are represented by undirected or directed graphproducts, to verify the effectiveness of the proposed method. Finally, conclusions are given in Section 4.otGraph Products for the Representation of Crease PatternstNGiven that an origami crease pattern can be considered to be a set of directionless crease lines which satisfy theripfoldability condition [16, 17], here we demonstrate that the pattern can be exactly expressed by a specific graphscproduct of independent graphs. By definition, a graph S consists of a set of nodes (or vertices) N(S), and a set ofManumembers (or edges) M(S) [18]. A relation of incidence for the nodes and members of a graph is denoted by anadjacency matrix A(S). The matrix A(S) of an undirected graph with n nodes is an n n symmetric matrix,whose entry Aij(S) in the ith row and jth column is given bycepted 1 if node i is connected to node j by a memberA ij S 0 otherwise(1)A graph is called to be a directed graph, provided that orientations are assigned to its members [14]. Then, aAcmodified adjacency matrix A S for this directed graph with n nodes can be defined as 1 if node i is connected to node j and directed from node i to node jAij S 0 otherwiseIn Eq. (2), the marix A S is an n n nonsymmetric matrix.Downloaded From: e.org on 02/07/2019 Terms of Use: http://www.asme.org/about-asme/terms-of-use(2)

Journal of Mechanical Design. Received September 29, 2018;Accepted manuscript posted January 17, 2019. doi:10.1115/1.4042791Copyright 2019 by ASMECartesian product of undirected graphsMany origami structures with degree-4 vertices (e.g., the Miura-ori) have symmetric patterns and thus can beconsidered to be the Cartesian product of simple graphs K and H, expressed as K H. In fact, the Cartesiandproduct of subgraphs K and H can be formed by taking copies of H for all the nodes of K and joining thesetecopies [13, 18, 19]. By using the Boolean operation for the Cartesian product, we can denote the correspondingyediadjacency matrix A(K H) as(3)CopA(K H) A(K) I nh I nk A(H)in which I nk is the nk nk identity matrix, nk is the number of nodes of the graph K, I nh is the nh nhotidentity matrix, nh is the number of nodes of the graph H, and describes the Kronecker product of thetNmatrices. For example, the Cartesian product of two simple graphs K P2 and H P3 (Fig. 1a-b) is illustrated inripFig. 1(c). Note that a graph P is known as a path graph whose nodes and members lie on a single straight linesc[19]. Consequently, the adjacency matrix A(K H) for the generated graph shown in Fig. 1(c) can be directlyManucomputed from Eq. (3), given by1010100100011000100101010 0 1 0 1 0 (4)Accepted 1 0 0 0 10 1 1 0 1 0A(K H) 010 1 0 0 0 1 0 1 0 1 0 0 101 1 0 0 0 Figure 1 The Cartesian product and strong Cartesian product of two simple graphsStrong Cartesian product of undirected graphsThe strong Cartesian product of two undirected graphs K and H is given by K H [20], which is another type ofBoolean operation. The nodes of graph K are denoted by ik , jk N(K) , and a member ik jk M (K) if it isDownloaded From: e.org on 02/07/2019 Terms of Use: http://www.asme.org/about-asme/terms-of-use

Journal of Mechanical Design. Received September 29, 2018;Accepted manuscript posted January 17, 2019. doi:10.1115/1.4042791Copyright 2019 by ASMEconnected by two nodes ik and jk . Similarly, we denote that a member ih jh M (H) is connected by twonodes ih , jh N(H) of graph H. Then, for different nodes i (ik , ih ) and j ( jk , jh ) of the strong Cartesianproduct K H, it satisfies(5)tedik jk , and ih jh M (H) if Nodes i and j are connected by a member elseif ih jh , and ik jk M (K) elseif ik jk M (K), and ih jh M (H)yediIn Eq. (5), the nodes i (ik , ih ), j ( jk , jh ) N(K) N(H) . Thus, the adjacency matrix A(K H) of the strongCopCartesian product is computed byA(K H) A(K) I nh I nk A(H) A(K) A(H)(6)otFor example, Fig. 1(d) plots the strong Cartesian product of the above-mentioned graphs K P2 and H P3. In thistNfigure, the diagonal members exist because the third condition in Eq. (5) is satisfied. In fact, the involvedripadjacency matrix A(K H) for the graph shown in Fig. 1(d) can be obtained from Eq. (3), written asDirected graph productsManusc 1 0 0 0 1 0 0 1 0 0 1 1 0 1 0 1 0 1 1 0 1 A(K H) 010 1 0 0 0 1 0 1 0 1 0 1 0 0 1 0 0 1 0 1 1 0 1011110100111100101111010 1 1 0 1 0 (7)ceptedType I directed graph product, which is denoted by ( )1 and proposed by Kaveh and Koohestani [13], isutilized to generate triangular patterns for multi-fold origami. For two directed graphs K and H, any two nodesi (ik , ih ) and j ( jk , jh ) are connected if one of these six conditions holds: (i) ik jk , ih jh M (H) ; (ii)Acik jk , jh ih M (H) ; (iii) ih jh , ik jk M (K) ; (iv) ih jh , jk ik M (K) ; (v) ik jk M (K) , ih jh M (H) ;(vi) jk ik M (K) , jh ih M (H) . It should be noted that, for directed graphs, ik jk M (K) holds if and only ifnode ik is connected to node jk and directed from node ik to node jk .To effectively generate the directed products of graphs K and H, we can also concern the correspondingadjacency matrix A(K ( )1 H), given byDownloaded From: e.org on 02/07/2019 Terms of Use: http://www.asme.org/about-asme/terms-of-use

Journal of Mechanical Design. Received September 29, 2018;Accepted manuscript posted January 17, 2019. doi:10.1115/1.4042791Copyright 2019 by ASMETTA(K ( )1 H) A (K) I nh I nk A(H) A(K) A(H) A (K) A (H)(8)where A(K) and A (H) denote the adjacency matrices of undirected graphs of K and H, and A(K) andA(H) can be obtained from Eq. (2). Some examples of this product are plotted in Fig. 2, whereas the graphs S1,dS2 and S3 are directed graphs. The member 23 of the directed graphs S2 and S3 in Fig. 2(b-c) has oppositetNotCopyeditedirections, which indicates the manner for generating the diagonal members.Figure 2 Type I directed graph products of several graphs S1, S2 and S3ripAlgebraic weighted graphsscGraph products can generate tessellations with new connectivity [13, 15]. However, certain geometricManuparameters such as angles between edge lines and the lengths of edges, which are not important in graph theory,have not been integrated into a conventional graph-theoretic approach [21-23]. In fact, these parameters areceptedimportant in the developability, flat-foldability, or rigid-foldability of an origami pattern [24-26], and thus theyshould be somehow incorporated.In this case, an integrated geometric-graph-theoretic framework is proposed, to include both geometry andAcconnectivity in the mathematical notation. Weighted graphs, which may be either directed or undirected, areutilized to incorporate the lengths of crease lines. In other words, each edge of a graph is associated with anumerical value, called a weight [22]. Then, an entry Aij(S) in the ith row and jth column of a weighted graph Sis defined as followsDownloaded From: e.org on 02/07/2019 Terms of Use: http://www.asme.org/about-asme/terms-of-use

Journal of Mechanical Design. Received September 29, 2018;Accepted manuscript posted January 17, 2019. doi:10.1115/1.4042791Copyright 2019 by ASME lijAij S 0if node i is connected to node j by a member(9)otherwisewhere lij denotes the length of the involved crease line. To effectively distinguish the directions of the creasesfor an origami crease pattern, 1 in Eq. (9) is denoted for a mountain fold, while 1 for a valley fold.tedFor a non-weighted graph lij should be replaced by unity. Thereafter, Eq. (9) reduces to either Eq. (1) or Eq.di(2). In addition, zero weights should be assigned to the members which need to be removed. In practice, the sumyeof absolute weights of a graph can be a measure of the complexity of crease processing.CopFurthermore, a turning angle between two adjacent edge lines is defined as the weight of the common node, todescribe the 2D geometric configuration of the subgraphs of an origami pattern. That is, the i-th entry Ni(S) of aotweighted graph S in 2D space is defined astNN i S i(10)ripwhere the turning angle 180 i 180 is the directed angle (the counterclockwise direction is positive [27])sc from vector N i -1 N i to vector N i N i 1 . The notation in Eq. (10) is specifically for path graphs and a generalManu2D graph, because it can neatly describe the orientation of the graph in 2D space. Note that the turning angles i of the two endpoints of an unclosed graph can be evaluated with respect to x axis.ceptedIn more general cases, nodal coordinates should be associated with a specific node to accurately describe theorigami pattern and its subgraphs in 3D space. Then, the i-th entry Ni(S) of a weighted graph S in 3D space isAcdefined asNi S xiyizi T(11)where xi, yi, and zi denote the coordinates of node i in 3D space.Further operations employed for graph productsWe have introduced several types of undirected/directed graph products, which are capable of generating a seriesof origami patterns. Nevertheless, other operations can be further employed to enhance this capability. TheseDownloaded From: e.org on 02/07/2019 Terms of Use: http://www.asme.org/about-asme/terms-of-use

Journal of Mechanical Design. Received September 29, 2018;Accepted manuscript posted January 17, 2019. doi:10.1115/1.4042791Copyright 2019 by ASMEadditional operations include intersection (e.g., S1 S2 ), ring sum (e.g., S1 S2 ) and union (e.g., S1 S2 ). Theyare useful for subtracting or adding groups of nodes and/or members. Furthermore, we can define otheroperations to strengthen these capabilities for the formation of complicated origami patterns. Complementarydexamples will be presented in the next section.teNote that the operands are assumed to have the same number of nodes. Then, the involved matrices of theyediresulted graph can be easily computed from the matrices of the operands. Moreover, a node should be deleted, onCopcondition that it is left non-connected to the other nodes [18].Examples of Origami StructuresotIn this section, different types of origami structures are developed using the introduced integratedripCrease pattern and truss framework of the Miura-oritNgeometric-graph-theoretic framework.scFigure 3(a) shows the crease pattern of the Miura-ori with 6 6 basic units. In fact, it can be generated from theManuCartesian product of a straight line P13 and a piecewise parallel polylines G1. As the acute angle and edge lengthsof the parallelogram for the basic uni

Introduction Origami is the art of folding 2D materials, such as a flat sheet of paper, into 3D objects with desired shapes. Since early 1980s, origami has evolved into a fertile scientific field connecting diverse disciplines, creating an

Related Documents:

Mechanical Contractor Redmon Heating & Cooling Grandville (616) 534-9330 Mechanical Contractor D.K.S. Mechanical, Inc. Marne (616) 677-6001 Mechanical Contractor AirFlow Mechanical Services LLC Wyoming (616) 752-0320 Mechanical Contractor Van Antwerp's Mechanical, Inc. Holland (616) 772-1112 Mechanical Contractor Grand Rapids Heating and .

[ ] International Journal of Mechanical Engineering and Research (HY) Rs. 3500.00 [ ] International Journal of Mechanical and Material Sciences Research (HY) Rs. 3500.00 [ ] International Journal of Material Sciences and Technology (HY) Rs. 3500.00 [ ] International Journal of Advanced Mechanical Engineering (HY) Rs. 3500.00

The Mechanical Foundation Series is a compulsory basic course for mechanical majors. It covers a wide range of courses, including mechanical drawing, mechanical principles, mechanical design, mechanical manufacturing foundation, engineering materials and tolerance technology measurement [1]. It is a learning

Anatomy of a journal 1. Introduction This short activity will walk you through the different elements which form a Journal. Learning outcomes By the end of the activity you will be able to: Understand what an academic journal is Identify a journal article inside a journal Understand what a peer reviewed journal is 2. What is a journal? Firstly, let's look at a description of a .

excess returns over the risk-free rate of each portfolio, and the excess returns of the long- . Journal of Financial Economics, Journal of Financial Markets Journal of Financial Economics. Journal of Financial Economics. Journal of Financial Economics Journal of Financial Economics Journal of Financial Economics Journal of Financial Economics .

Create Accounting Journal (Manual) What are the Key Steps? Create Journal Enter Journal Details Submit the Journal Initiator will start the Create Journal task to create an accounting journal. Initiator will enter the journal details, and add/populate the journal lines, as required. *Besides the required fields, ensure at least

Smith Matt J. Vaculik Milton R. Keener Occupation No reply received No reply received Firefighter/EMT Monclova Twp Cattle Business Manager Retired Educator No reply received No reply received No reply received No reply received No reply received Education Anthony Wayne high-school 2008-2012 Four-County Career center 2012-2013 Firefighter I, EMT .

for mechanical engineers in tamilnadu, list of government jobs for mechanical engineers in karnataka, list of government jobs for diploma mechanical engineer, list of govt jobs for mechanical engineers T), MCA, Electronics and Communication (ECE), Mechanical, Electrical and . l Design automation -