DOCSLIB.ORG

III IIHIIIHIII USOO5524396A United States Patent (19 11) Patent Number: 5,524,396 Lalvani 45 Date of Patent: Jun

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
III IIHIIIHIII USOO5524396A United States Patent (19 11) Patent Number: 5,524,396 Lalvani 45 Date of Patent: Jun III IIHIIIHIII USOO5524396A United States Patent (19 11) Patent Number: 5,524,396 Lalvani 45 Date of Patent: Jun. 11, 1996 54). SPACE STRUCTURES WITH NON-PERIODIC Regular Polytopes by H. S. M. Coxeter, Dover, 1963, pp. SUBDIVISIONS OF POLYGONAL FACES 27-33 T6) Inventor: Haresh Lalvani, 164 Bank St., Apt. Primary Examiner Wynn E. Wood 2B, New York, N.Y. 10014 (57) ABSTRACT (21) Appi. No. 75,145 A family of Space structures having subdivided faces, where such faces are subdivided into rhombii in non-periodic 22 Filed: Jun. 10, 1993 arrangements. The rhombii are derived from regular planar (51) Int. Cl. ................................................ E04B 1/32 Stars with n vectors, and the source space structures are 52 U.S. Cl. ........................... 52/81.1; 52/81.2: 52/311.2: composed of regular polygons. The family includes: glo 52/DIG. 10 bally symmetric structures where the fundamental region is 58 Field of Search .................... 52/81.2, 311, DIG. 10, subdivided non-periodically, or globally asymmetric struc 52/81.1 tures composed of regular polygons which are subdivided non-periodically or asymmetrically. The rhombii can be 56 References Cited further subdivided periodically or non-periodically. The family further includes all regular polyhedra in the plane U.S. PATENT DOCUMENTS faced and curve-faced States, regular tessellations, various 1,976, 188 9/1934 Hozawa ................................... 52(81.2 curved polygons, cylinders and toroids, curved space laby 2,361,540 10/1944. Forbes ......... 52/82 rinths, and regular structures in higher-dimensional and 2,978,704 4/1961 Cohen et al. 52/812 hyperbolic space. The structures can be isolated structures or 3,058,550 971962 Richter ..................................... 52A812 grouped to fill space. Applications include architectural 3,154,887 11/1964 Schmidt ................................... 52/812 space structures, fixed or retractable space frames, domes, 3,722,153 3/1973 Baer. vaults, saddle structures, plane or curved tiles, model-kits, 4,133,152 1/1979 Penrose toys, games, and artistic and sculptural works realized in 2 5,007,220 4/1991 Lalvani. and 3-dimensions. The structures could be composed of 5,036,635 8/1991 Lalvani ......................................... 52/8 individual units capable of being assembled or disas OTHER PUBLICATIONS sembled, or structures which are cast in one piece, or combination of both. Various tensile and compressive struc Uniform Ant-hills in the World of Golden Isozonohedra by tural systems, and techniques of triangulation could be used K. Miyazaki, Structural Topology, #4, 1980 pp. 21-30 as needed for stability. (Canada). Fourfield: Computers, Art & the 4th Dimension by Tony Robbin, Bullfinch Press, 1992 pp. 81-94. 25 Claims, 57 Drawing Sheets U.S. Patent Jun. 11, 1996 Sheet 1 of 57 5,524.396 2 3 4. 5 6 7 8 9 1C) . ?h (9d) (6O) (45) (36) (3C5) (25.7) (252) (20) (18) . (7/5 1 5 2 A / A/A 747 - - 2-2 2-3 / 2-4 1 2-5 1 2-6 ? ? 20 2f 22 A 7 ses, 3-3 3-4 3-5 / / / 22 24- 25 4. 4-5 4-6 4-4 / 26 5-5 N--3ig. 1 U.S. Patent Jun. 11, 1996 Sheet 2 of 57 5,524.396 3ig. 2. U.S. Patent Jun. 11, 1996 Sheet 3 of 57 5,524.396 n=4 nic n=6 n=7 . a.A. / is 2-34Cld -a, -223 - ?2-15:34 -:(-1: it 44 60 U.S. Patent Jun. 11, 1996 Sheet 4 of 57 5,524.396 U.S. Patent Jun. 11, 1996 Sheet 5 of 57 5,524.396 U.S. Patent Jun. 11, 1996 Sheet 6 of 57 5,524,396 U.S. Patent Jun. 11, 1996 Sheet 7 of 57 5,524,396 U.S. Patent Jun. 11, 1996 Sheet 8 of 57 5,524,396 27-A & KO/kXOkk A 2 / . N11 NTN17------------A---Ya--------------------------------, wr--rrs ------------wa------------ r n --------------------- U.S. Patent Jun. 11, 1996 Sheet 9 of 57 5,524,396 D.C. iDDC. D.DS S.S.S.) 15. $1NNM1NTM 11N, 1N1,. U.S. Patent Jun. 11, 1996 Sheet 10 of 57 5,524,396 U.S. Patent 5,524,396 U.S. Patent Jun. 11, 1996 Sheet 16 of 57 5,524.396 U.S. Patent Jun. 11, 1996 Sheet 17 of 57 5,524,396 U.S. Patent Jun. 11, 1996 Sheet 18 of 57 5,524.396 P.(S32. Sy2S3, Szo-an CYZZ-CS3 NYKYao CS) WCKSS),STSYS, VSYNCOS) (SAN1/ sy NC -- 2, S NN 4 (X)SS \ flotiff363, on y^xy Cis SYYzAllSCCSS A.W. y (SAS 7 1 NS <1XShe N <13XXie N D453, WJ A BSA3, () A 27.2) (SZS3.SS2E ES3<>/KXSS &S3.4.Y SBS () SK3333333 K. V.33. (SAS SS X-23SSXSS 3.Sk, SS SySt. NSKKSN.E. CSS) (KS,K2 -X) C Q(SS)NQ -- 12, Sysi?63. 427 Sty \63.N3A).<>(CSS y U.S. Patent Jun. 11, 1996 Sheet 19 of 57 5,524,396 U.S. Patent Jun. 11, 1996 Sheet 20 of 57 5,524,396 S.S. 8.t $7 3. ise3.11 4KOY U.S. Patent Jun. 11, 1996 Sheet 21 of 57 5,524,396 U.S. Patent Jun. 11, 1996 Sheet 22 of 57 5,524,396 \ 2. Ns NSSS 22. AS D SSSSSN VDs ()A. k1 (S4. ROE) [N]?A U.S. Patent Jun. 11, 1996 Sheet 23 of 57 5,524,396 (KYA, KEX,E)& EXA ASXCXX SK2S2,PKKSKKissFS K*. 323s. As AS VSYNEX,AY37 Sk1NAA VXXXSS NYP3XYSyNANA N4&Y / \le 392 U.S. Patent Jun. 11, 1996 Sheet 27 of 57 5,524,396 U.S. Patent Jun. 11, 1996 Sheet 28 of 57 4% Na as KAANY6NZSS gS(XXXSSX NS2. A/13/1x3N(sax/SY YXOSVAX7 3. KYYXSS D. SSX2 &gate2XCX X 2e. U.S. Patent Jun. 11, 1996 Sheet 30 of 57 5,524.396 U.S. Patent Jun. 11, 1996 Sheet 31 of 57 5,524.396 U.S. Patent Jun. 11, 1996 Sheet 32 of 57 U.S. Patent Jun. 11, 1996 Sheet 33 of 57 5,524.396 U.S. Patent Jun. 11, 1996 Sheet 34 of 57 5,524,396 as 2-, 3-, 4-, 5-, 6-; 7: ...-- q=7 32,7: 3,7: 34,7: 35,7: 36,7: 37,7: ...-a,7: q=6 32,6: 33,6: 34,6: 35,6: 36,6: 37,6: ...3-2,68 q=2 32,2: 35,2: 34,2: 35,28 36,2: 37,28 .328 C p=2 p=3 p=4 p=5 p=6 p=7 p=ed N -- 3ig. 14 U.S. Patent Jun. 11, 1996 Sheet 35 of 57 5,524,396 2,2%22 U.S. Patent Jun. 11, 1996 Sheet 36 of 57 5,524,396 CEO.NC227 s2. /20 K2SX2SS STS-334 CSXSSX/ES)KKXXXXXXX: 13. XSSSI fixes29SC (NASA ISSx afé S.SN 120 Ax7ckAa 227& NSSNSXkNx\\ SS KKKXXXXXCCK)AYS3KNA CKCSY. If S3:2)VS X 4N X KX al-as-as U.S. Patent Jun. 11, 1996 Sheet 37 of 57 5,524,396 (LWNY 7 3. Y ' U.S. Patent Jun. 11, 1996 Sheet 39 of 57 5,524.396 U.S. Patent Jun. 11, 1996 Sheet 41 of 57 5,524,396 U.S. Patent Jun. 11, 1996 Sheet 42 of 57 5,524.396 U.S. Patent Jun. 11, 1996 Sheet 43 of 57 5,524,396 SS 23S state2a33a Seas A. s . is&SSSSSSS SESS ASSES Si:SSES. SSS& &SisSS: SESSESSSE&S SaSSSshalf SSS $3.Sks U.S. Patent Jun. 11, 1996 Sheet 44 of 57 5,524,396 43/3s SK23, 2, E3:33 &S 33S.S.S.). 3. SSS.ly NN y (a), KZS35 2-YNSDTS 3, (OKX 7 S.S.S.St. 53CE,S 33.(K)2232 a U.S. Patent Jun. 11, 1996 Sheet 45 of 57 5,524,396 ZX S/NADS. CSDASYYYNK ak SkySSS. {A AXSNS NN t N CN SkyAKN5 See Sri Ariy K : X XX:X:S A. ET N73.<KXC-KSKSSXKNSKC. KykkXXYY77 YSAYAYY-SA 2KKKNW (YA 2KSX52AX7), YERRCERYE^2 KYSCKCKYYXNE, SEE YXY. Y&2 (APYK-2 5. XY.Y., S.K..) NNke SNKNSESS.A.Y.E.E. Aye A.E.IZXXEWAD S.K.3 A. 22:52,W, SSSSSSSS&AXA2NNN 3. A33A2575A. 77 SN32.25)WN N3 (Y42A225.4% 224 NŠS SSSSSS22.52 52.2%7 2252A2a2.426 U.S. Patent Jun. 11, 1996 Sheet 48 of 57 5,524,396 U.S. Patent Jun. 11, 1996 Sheet 49 of 57 5,524,396 A. 3. (i. 2:7 A. A.C 8 2. s V N s N K KSS SSSeSN s SS2.S2 ?: 3ig. 22a. U.S. Patent Jun. 11, 1996 Sheet 51 of 57 5,524,396 SSSSS-2262s2237S42k2E2223.4%ly 12a. ŠS226233632.23SNSSS2,611252,22NSSNSSK222-23 2335 SNSSNS42(xstas?.2%A. N- 62.32232 NS-232227SS23222326 SŠ22NS22s Sea NSS3? se Syses.-, O f f2 3. K 6.KS 8E. SSE 2 (A W 2 22, (SSEE p 22 VNW 4 2 3. 3. 2x5 Á2. 22 t S 2. SyNSSS) SY (SSSSSSSSSS S NS& si. 2 222s2SSNN 22a seas U.S. Patent Jun. 11, 1996 Sheet 52 of 57 5,524,396 U.S. Patent Jun. 11, 1996 Sheet 54 of 57 5,524,396 3.g. 25l. U.S. Patent Jun. 11, 1996 Sheet 55 of 57 5,524,396 3.g. 26 U.S. Patent Jun. 11, 1996 Sheet 56 of 57 5,524,396 5,524,396 1. 2 SPACE STRUCTURES WITH NON-PERIODC The structual advantages of the 'new' space structures SUBDIVISIONS OF POLYGONAL FACES disclosed here remain to be examined and analyzed.
Load more

Recommended publications
  • Snub Cell Tetricosa
    E COLE NORMALE SUPERIEURE ________________________ A Zo o of ` embeddable Polytopal Graphs Michel DEZA VP GRISHUHKIN LIENS ________________________ Département de Mathématiques et Informatique CNRS URA 1327 A Zo o of ` embeddable Polytopal Graphs Michel DEZA VP GRISHUHKIN LIENS January Lab oratoire dInformatique de lEcole Normale Superieure rue dUlm PARIS Cedex Tel Adresse electronique dmiensfr CEMI Russian Academy of Sciences Moscow A zo o of l embeddable p olytopal graphs MDeza CNRS Ecole Normale Superieure Paris VPGrishukhin CEMI Russian Academy of Sciences Moscow Abstract A simple graph G V E is called l graph if for some n 2 IN there 1 exists a vertexaddressing of each vertex v of G by a vertex av of the n cub e H preserving up to the scale the graph distance ie d v v n G d av av for all v 2 V We distinguish l graphs b etween skeletons H 1 n of a variety of well known classes of p olytop es semiregular regularfaced zonotop es Delaunay p olytop es of dimension and several generalizations of prisms and antiprisms Introduction Some notation and prop erties of p olytopal graphs and hypermetrics Vector representations of l metrics and hypermetrics 1 Regularfaced p olytop es Regular p olytop es Semiregular not regular p olytop es Regularfaced not semiregularp olytop es of dimension Prismatic graphs Moscow and Glob e graphs Stellated k gons Cup olas Antiwebs Capp ed antiprisms towers and fullerenes regularfaced not semiregular p olyhedra Zonotop es Delaunay p olytop es Small
    [Show full text]
  • 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.
    [Show full text]
  • Arxiv:Math/9906062V1 [Math.MG] 10 Jun 1999 Udo Udmna Eerh(Rn 96-01-00166)
    Embedding the graphs of regular tilings and star-honeycombs into the graphs of hypercubes and cubic lattices ∗ Michel DEZA CNRS and Ecole Normale Sup´erieure, Paris, France Mikhail SHTOGRIN Steklov Mathematical Institute, 117966 Moscow GSP-1, Russia Abstract We review the regular tilings of d-sphere, Euclidean d-space, hyperbolic d-space and Coxeter’s regular hyperbolic honeycombs (with infinite or star-shaped cells or vertex figures) with respect of possible embedding, isometric up to a scale, of their skeletons into a m-cube or m-dimensional cubic lattice. In section 2 the last remaining 2-dimensional case is decided: for any odd m ≥ 7, star-honeycombs m m {m, 2 } are embeddable while { 2 ,m} are not (unique case of non-embedding for dimension 2). As a spherical analogue of those honeycombs, we enumerate, in section 3, 36 Riemann surfaces representing all nine regular polyhedra on the sphere. In section 4, non-embeddability of all remaining star-honeycombs (on 3-sphere and hyperbolic 4-space) is proved. In the last section 5, all cases of embedding for dimension d> 2 are identified. Besides hyper-simplices and hyper-octahedra, they are exactly those with bipartite skeleton: hyper-cubes, cubic lattices and 8, 2, 1 tilings of hyperbolic 3-, 4-, 5-space (only two, {4, 3, 5} and {4, 3, 3, 5}, of those 11 have compact both, facets and vertex figures). 1 Introduction arXiv:math/9906062v1 [math.MG] 10 Jun 1999 We say that given tiling (or honeycomb) T has a l1-graph and embeds up to scale λ into m-cube Hm (or, if the graph is infinite, into cubic lattice Zm ), if there exists a mapping f of the vertex-set of the skeleton graph of T into the vertex-set of Hm (or Zm) such that λdT (vi, vj)= ||f(vi), f(vj)||l1 = X |fk(vi) − fk(vj)| for all vertices vi, vj, 1≤k≤m ∗This work was supported by the Volkswagen-Stiftung (RiP-program at Oberwolfach) and Russian fund of fundamental research (grant 96-01-00166).
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • 131 865- EDRS PRICE Technclogy,Liedhanical
    ..DOCUMENT RASH 131 865- JC 760 420 TITLE- Training Program for Teachers of Technical Mathematics in Two-Year Cutricnla. INSTITUTION Queensborough Community Coll., Bayside, N Y. SPONS AGENCY New York State Education Dept., Albany. D v.of Occupational Education Instruction. PUB DATE Jul 76 GRANT VEA-78-2-132 NOTE 180p. EDRS PRICE MP-$0.83 HC-S10.03 Plus Postage. DESCRIPTORS *College Mathematics; Community Colleges; Curriculum Development; Engineering Technology; *Junior Colleges Mathematics Curriculum; *Mathematics Instruction; *Physics Instruction; Practical ,Mathematics Technical Education; *Technical Mathematics Technology ABSTRACT -This handbook 1 is designed'to.aS ist teachers of techhical'mathematics in:developing practically-oriented-curricula -for their students. The upderlying.assumption is that, while technology students are nOt a breed apartr their: needs-and orientation are_to the concrete, rather than the abstract. It describes the:nature, scope,and dontett,of curricula.. in Electrical, TeChnClogy,liedhanical Technology4 Design DraftingTechnology, and: Technical Physics', ..with-particularreterence to:the mathematical skills which are_important for the students,both.incollege.andot -tle job. SaMple mathematical problemsr-derivationSeand.theories tei be stressed it..each of_these.durricula-are presented, as- ate additional materials from the physics an4 mathematics. areas. A frame ok-reference-is.provided through diScussiotS ofthe\careers,for.which-. technology students-are heing- trained'. There.iS alsO &section deioted to
    [Show full text]
  • 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).
    [Show full text]
  • Four-Dimensional Regular Polytopes
    faculty of science mathematics and applied and engineering mathematics Four-dimensional regular polytopes Bachelor’s Project Mathematics November 2020 Student: S.H.E. Kamps First supervisor: Prof.dr. J. Top Second assessor: P. Kiliçer, PhD Abstract Since Ancient times, Mathematicians have been interested in the study of convex, regular poly- hedra and their beautiful symmetries. These five polyhedra are also known as the Platonic Solids. In the 19th century, the four-dimensional analogues of the Platonic solids were described mathe- matically, adding one regular polytope to the collection with no analogue regular polyhedron. This thesis describes the six convex, regular polytopes in four-dimensional Euclidean space. The focus lies on deriving information about their cells, faces, edges and vertices. Besides that, the symmetry groups of the polytopes are touched upon. To better understand the notions of regularity and sym- metry in four dimensions, our journey begins in three-dimensional space. In this light, the thesis also works out the details of a proof of prof. dr. J. Top, showing there exist exactly five convex, regular polyhedra in three-dimensional space. Keywords: Regular convex 4-polytopes, Platonic solids, symmetry groups Acknowledgements I would like to thank prof. dr. J. Top for supervising this thesis online and adapting to the cir- cumstances of Covid-19. I also want to thank him for his patience, and all his useful comments in and outside my LATEX-file. Also many thanks to my second supervisor, dr. P. Kılıçer. Furthermore, I would like to thank Jeanne for all her hospitality and kindness to welcome me in her home during the process of writing this thesis.
    [Show full text]
  • 900.00 Modelability
    986.310 Strategic Use of Min-max Cosmic System Limits 986.311 The maximum limit set of identical facets into which any system can be divided consists of 120 similar spherical right triangles ACB whose three corners are 60 degrees at A, 90 degrees at C, and 36 degrees at B. Sixty of these right spherical triangles are positive (active), and 60 are negative (passive). (See Sec. 901.) 986.312 These 120 right spherical surface triangles are described by three different central angles of 37.37736814 degrees for arc AB, 31.71747441 degrees for arc BC, and 20.90515745 degrees for arc AC__which three central-angle arcs total exactly 90 degrees. These 120 spherical right triangles are self-patterned into producing 30 identical spherical diamond groups bounded by the same central angles and having corresponding flat-faceted diamond groups consisting of four of the 120 angularly identical (60 positive, 60 negative) triangles. Their three surface corners are 90 degrees at C, 31.71747441 degrees at B, and 58.2825256 degrees at A. (See Fig. 986.502.) 986.313 These diamonds, like all diamonds, are rhombic forms. The 30- symmetrical- diamond system is called the rhombic triacontahedron: its 30 mid- diamond faces (right- angle cross points) are approximately tangent to the unit- vector-radius sphere when the volume of the rhombic triacontahedron is exactly tetravolume-5. (See Fig. 986.314.) 986.314 I therefore asked Robert Grip and Chris Kitrick to prepare a graphic comparison of the various radii and their respective polyhedral profiles of all the symmetric polyhedra of tetravolume 5 (or close to 5) existing within the primitive cosmic hierarchy (Sec.
    [Show full text]
  • 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.
    [Show full text]
  • ADDENDUM the Following Remarks Were Added in Proof (November 1966). Page 67. an Easy Modification of Exercise 4.8.25 Establishes
    ADDENDUM The following remarks were added in proof (November 1966). Page 67. An easy modification of exercise 4.8.25 establishes the follow­ ing result of Wagner [I]: Every simplicial k-"complex" with at most 2 k ~ vertices has a representation in R + 1 such that all the "simplices" are geometric (rectilinear) simplices. Page 93. J. H. Conway (private communication) has established the validity of the conjecture mentioned in the second footnote. Page 126. For d = 2, the theorem of Derry [2] given in exercise 7.3.4 was found earlier by Bilinski [I]. Page 183. M. A. Perles (private communication) recently obtained an affirmative solution to Klee's problem mentioned at the end of section 10.1. Page 204. Regarding the question whether a(~) = 3 implies b(~) ~ 4, it should be noted that if one starts from a topological cell complex ~ with a(~) = 3 it is possible that ~ is not a complex (in our sense) at all (see exercise 11.1.7). On the other hand, G. Wegner pointed out (in a private communication to the author) that the 2-complex ~ discussed in the proof of theorem 11.1 .7 indeed satisfies b(~) = 4. Page 216. Halin's [1] result (theorem 11.3.3) has recently been genera­ lized by H. A. lung to all complete d-partite graphs. (Halin's result deals with the graph of the d-octahedron, i.e. the d-partite graph in which each class of nodes contains precisely two nodes.) The existence of the numbers n(k) follows from a recent result of Mader [1] ; Mader's result shows that n(k) ~ k.2(~) .
    [Show full text]
  • 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
    [Show full text]