DOCSLIB.ORG

Visualization of Regular Maps : the Chase Continues

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Visualization of Regular Maps : the Chase Continues Visualization of regular maps : the chase continues Citation for published version (APA): Wijk, van, J. J. (2014). Visualization of regular maps : the chase continues. IEEE Transactions on Visualization and Computer Graphics, 20(12), 2614-2623. https://doi.org/10.1109/TVCG.2014.2352952 DOI: 10.1109/TVCG.2014.2352952 Document status and date: Published: 01/01/2014 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the “Taverne” license above, please follow below link for the End User Agreement: www.tue.nl/taverne Take down policy If you believe that this document breaches copyright please contact us at: [email protected] providing details and we will investigate your claim. Download date: 24. Sep. 2021 2614 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. 20, NO. 12, DECEMBER 2014 Visualization of Regular Maps: The Chase Continues Jarke J. van Wijk, Member, IEEE Abstract—A regular map is a symmetric tiling of a closed surface, in the sense that all faces, vertices, and edges are topologically indistinguishable. Platonic solids are prime examples, but also for surfaces with higher genus such regular maps exist. We present a new method to visualize regular maps. Space models are produced by matching regular maps with target shapes in the hyperbolic plane. The approach is an extension of our earlier work. Here a wider variety of target shapes is considered, obtained by duplicating spherical and toroidal regular maps, merging triangles, punching holes, and gluing the edges. The method produces about 45 new examples, including the genus 7 Hurwitz surface. Index Terms—regular maps, tiling, tessellation, surface topology, mathematical visualization 1INTRODUCTION In graph theory, a map is a crossing-free embedding of a graph on a combination of heuristics, insights, and a variety of media, ranging a surface. A regular map is a map that is vertex-, face-, and edge- from sketches to computer models to 3D printing. An alternative is to transitive, i.e., each vertex, face, and edge is topologically indistin- use an automatic approach. In 2009 we translated the problem into au- guishable from the other elements of the same type. Classic examples tomatically finding matching patterns in hyperbolic space. About 50 of regular maps are the Platonic solids, which are regular maps on new solutions resulted, but for many regular maps it is still unknown spheres. But also for surfaces with higher genus g such regular maps what their space models could look like. can be found. The genus is informally equal to the number of holes The choice of the target surface is important, both in manual and in the shape. The Euler number χ = V − E + F, with V the num- automatic approaches. Typically a smooth closed surface is used, cov- ber of vertices, E the number of edges, and F the number of faces is ered with a face-transitive map. Decorating each face with the same an invariant for the genus of the surface, and for orientable surfaces pattern should hopefully lead to a depiction of a regular map. Sequin´ χ = 2 − 2g. used a tetrus, the shape that results when replacing the edges of a tetra- Regular maps on tori, genus 1 surfaces, can be found easily. As hedron by tubes, to visualize regular maps of genus 3. We extended an example, folding a chessboard by matching opposite sides gives this approach, and used tubified regular maps as target surfaces, where a torus decorated with a regular map. For genus 2 and higher, the quarter tubes were used as target faces. problem to produce visualizations of regular maps is much more com- In this paper we present a generalization of our earlier approach. We plex. It is known what regular maps exist. Conder [4] has enumerated use a richer set of target surfaces, obtained by duplicating space mod- all reflexible regular maps on orientable surfaces up to genus 101, and els of regular maps of genus 0 and 1, merging triangles, systematically found 6104 different cases. Each map is described here via its symme- punching holes, and gluing the edges. This leads to a face-transitive try group. In graphics terminology, the structure of the faces, edges, map, consisting of topologically identical faces, configured in a cer- and vertices is given, but no possible geometric realization, i.e.,no tain pattern, and which may have vertices of different valences around possible space models are given. their perimeter. Also, regular maps can be simplified to face-transitive It is a fascinating problem to produce space models of regular maps: maps. This approach is more generic than the earlier approach, which surfaces embedded in 3D, decorated with colored faces, edges, and was limited to the use of tubified regular maps as target shapes. vertices depicting regular maps. Regular maps are not an esoteric, Like in the earlier approach, we use a two-step matching process to abstract concept, they can be described in a very concrete and geo- find new solutions. First, simplified regular maps and target surfaces metric way. For instance, the Hurwitz genus 7 surface consists of 168 are matched, to find combinations of these with similar faces and sim- triangles, at each vertex 7 triangles meet, and each Petrie-polygon (a ilar patterns; next, exact solutions are sought for by aligning points of closed zig-zag path over the edges) has 18 edges. But, what could the target surface with points of the regular map in hyperbolic space. A such a shape look like? The papers of Carlo Sequin´ [20, 21, 22]give novelty here is the smoothing of meshes in hyperbolic space, leading an interesting and entertaining account on how to attack this problem; to edges with less kinks. we argued earlier [24] that this class of puzzles is close to perfect. Compared to the earlier approach, the number of regular maps that Also, the scope of this topic is large. Regular maps relate to many can be visualized almost doubles, and all examples given in this paper different branches of mathematics [14]. Symmetry is described by are new. Specifically interesting is the first visualization of the Hurwitz algebra, shapes by geometry, and regular maps can be studied from the genus 7 surface, also known as the MacBeath surface. point of view of surface topology, combinatorial group theory, graph In the next section we give a short introduction on concepts used, theory, hyperbolic geometry, and algebraic geometry. Finally, there is and discuss related work. Next, we give a global overview of our ap- an artistic interest, as these highly symmetric objects lead to complex proach in Section 3, followed by a detailed description of the various and fascinating shapes. steps in Sections 4 to 7. Results are presented and discussed in Sec- Roughly, there are two main approaches to come up with solutions tion 8, followed by conclusions in Section 9. for the visualization of regular maps. The work of Sequin´ is the key ex- ample of the manual approach. He has produced a steadily growing set 2BACKGROUND of space models of regular maps by attacking them one by one, using As mentioned, regular maps are located at the intersection of differ- ent branches of mathematics, and to understand and process regular • Jarke J. van Wijk is with Eindhoven University of Technology. E-mail: maps, some background is needed. We assume basic knowledge of [email protected]. group theory and hyperbolic geometry. We used Beardon [2], Ka- Manuscript received 31 Mar. 2014; accepted 1 Aug. 2014. D ate of tok [12], and Anderson [1] for understanding tilings, Fuchsian groups, publication11Aug. 2014; date of current version 9 Nov. 2014. and hyperbolic geometry; Firby and Gardiner [9] for surface topology; For information on obtaining reprints of this article, please send Coxeter [6], Coxeter and Moser [7] and Conder and Dobcsanyi´ [5] for e-mail to: [email protected]. regular maps. Here we describe some basic concepts and terminology, Digital Object Identifier 10.1109/TVCG.2014.2352952 mainly by examples, that are used in the following sections. 1077-2626 © 2014 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information. VAN WIJK: VISUALIZATION OF REGULAR MAPS: THE CHASE CONTINUES 2615 R3 R4 2 2 2 M M R R S R 1 aba R2S N O b ab R I a bc S 2 N c O RS 2 ca S RS Fig.
Load more

Recommended publications
  • Systematic Narcissism
    Systematic Narcissism Wendy W. Fok University of Houston Systematic Narcissism is a hybridization through the notion of the plane- tary grid system and the symmetry of narcissism. The installation is based on the obsession of the physical reflection of the object/subject relation- ship, created by the idea of man-made versus planetary projected planes (grids) which humans have made onto the earth. ie: Pierre Charles L’Enfant plan 1791 of the golden section projected onto Washington DC. The fostered form is found based on a triacontahedron primitive and devel- oped according to the primitive angles. Every angle has an increment of 0.25m and is based on a system of derivatives. As indicated, the geometry of the world (or the globe) is based off the planetary grid system, which, according to Bethe Hagens and William S. Becker is a hexakis icosahedron grid system. The formal mathematical aspects of the installation are cre- ated by the offset of that geometric form. The base of the planetary grid and the narcissus reflection of the modular pieces intersect the geometry of the interfacing modular that structures the installation BACKGROUND: Poetics: Narcissism is a fixation with oneself. The Greek myth of Narcissus depicted a prince who sat by a reflective pond for days, self-absorbed by his own beauty. Mathematics: In 1978, Professors William Becker and Bethe Hagens extended the Russian model, inspired by Buckminster Fuller’s geodesic dome, into a grid based on the rhombic triacontahedron, the dual of the icosidodeca- heron Archimedean solid. The triacontahedron has 30 diamond-shaped faces, and possesses the combined vertices of the icosahedron and the dodecahedron.
    [Show full text]
  • On Discrete Generalised Triangle Groups
    Proceedings of the Edinburgh Mathematical Society (1995) 38, 397-412 © ON DISCRETE GENERALISED TRIANGLE GROUPS by M. HAGELBERG, C. MACLACHLAN and G. ROSENBERGER (Received 29th October 1993) A generalised triangle group has a presentation of the form where R is a cyclically reduced word involving both x and y. When R=xy, these classical triangle groups have representations as discrete groups of isometries of S2, R2, H2 depending on In this paper, for other words R, faithful discrete representations of these groups in Isom + H3 = PSL(2,C) are considered with particular emphasis on the case /? = [x, y] and also on the relationship between the Euler characteristic x and finite covolume representations. 1991 Mathematics subject classification: 20H15. 1. Introduction In this article, we consider generalised triangle groups, i.e. groups F with a presentation of the form where R(x,y) is a cyclically reduced word in the free product on x,y which involves both x and y. These groups have been studied for their group theoretical interest [8, 7, 13], for topological reasons [2], and more recently for their connections with hyperbolic 3-manifolds and orbifolds [12, 10]. Here we will be concerned with faithful discrete representations p:T-*PSL(2,C) with particular emphasis on the cases where the Kleinian group p(F) has finite covolume. In Theorem 3.2, we give necessary conditions on the group F so that it should admit such a faithful discrete representation of finite covolume. For certain generalised triangle groups where the word R(x,y) has a specified form, faithful discrete representations as above have been constructed by Helling-Mennicke- Vinberg [12] and by the first author [11].
    [Show full text]
  • E8 Physics and Quasicrystals Icosidodecahedron and Rhombic Triacontahedron Vixra 1301.0150 Frank Dodd (Tony) Smith Jr
    E8 Physics and Quasicrystals Icosidodecahedron and Rhombic Triacontahedron vixra 1301.0150 Frank Dodd (Tony) Smith Jr. - 2013 The E8 Physics Model (viXra 1108.0027) is based on the Lie Algebra E8. 240 E8 vertices = 112 D8 vertices + 128 D8 half-spinors where D8 is the bivector Lie Algebra of the Real Clifford Algebra Cl(16) = Cl(8)xCl(8). 112 D8 vertices = (24 D4 + 24 D4) = 48 vertices from the D4xD4 subalgebra of D8 plus 64 = 8x8 vertices from the coset space D8 / D4xD4. 128 D8 half-spinor vertices = 64 ++half-half-spinors + 64 --half-half-spinors. An 8-dim Octonionic Spacetime comes from the Cl(8) factors of Cl(16) and a 4+4 = 8-dim Kaluza-Klein M4 x CP2 Spacetime emerges due to the freezing out of a preferred Quaternionic Subspace. Interpreting World-Lines as Strings leads to 26-dim Bosonic String Theory in which 10 dimensions reduce to 4-dim CP2 and a 6-dim Conformal Spacetime from which 4-dim M4 Physical Spacetime emerges. Although the high-dimensional E8 structures are fundamental to the E8 Physics Model it may be useful to see the structures from the point of view of the familiar 3-dim Space where we live. To do that, start by looking the the E8 Root Vector lattice. Algebraically, an E8 lattice corresponds to an Octonion Integral Domain. There are 7 Independent E8 Lattice Octonion Integral Domains corresponding to the 7 Octonion Imaginaries, as described by H. S. M. Coxeter in "Integral Cayley Numbers" (Duke Math. J. 13 (1946) 561-578 and in "Regular and Semi-Regular Polytopes III" (Math.
    [Show full text]
  • Arxiv:Math/0306105V2
    A bound for the number of automorphisms of an arithmetic Riemann surface BY MIKHAIL BELOLIPETSKY Sobolev Institute of Mathematics, Novosibirsk, 630090, Russia e-mail: [email protected] AND GARETH A. JONES Faculty of Mathematical Studies, University of Southampton, Southampton, SO17 1BJ e-mail: [email protected] Abstract We show that for every g ≥ 2 there is a compact arithmetic Riemann surface of genus g with at least 4(g − 1) automorphisms, and that this lower bound is attained by infinitely many genera, the smallest being 24. 1. Introduction Schwarz [17] proved that the automorphism group of a compact Riemann surface of genus g ≥ 2 is finite, and Hurwitz [10] showed that its order is at most 84(g − 1). This bound is sharp, by which we mean that it is attained for infinitely many g, and the least genus of such an extremal surface is 3. However, it is also well known that there are infinitely many genera for which the bound 84(g − 1) is not attained. It therefore makes sense to consider the maximal order N(g) of the group of automorphisms of any Riemann surface of genus g. Accola [1] and Maclachlan [14] independently proved that N(g) ≥ 8(g +1). This bound is also sharp, and according to p. 93 of [2], Paul Hewitt has shown that the least genus attaining it is 23. Thus we have the following sharp bounds for N(g) with g ≥ 2: 8(g + 1) ≤ N(g) ≤ 84(g − 1). arXiv:math/0306105v2 [math.GR] 21 Nov 2004 We now consider these bounds from an arithmetic point of view, defining arithmetic Riemann surfaces to be those which are uniformized by arithmetic Fuchsian groups.
    [Show full text]
  • Rhombic Triacontahedron
    Rhombic Triacontahedron Figure 1 Rhombic Triacontahedron. Vertex labels as used for the corresponding vertices of the 120 Polyhedron. COPYRIGHT 2007, Robert W. Gray Page 1 of 11 Encyclopedia Polyhedra: Last Revision: August 5, 2007 RHOMBIC TRIACONTAHEDRON Figure 2 Icosahedron (red) and Dodecahedron (yellow) define the rhombic Triacontahedron (green). Figure 3 “Long” (red) and “short” (yellow) face diagonals and vertices. COPYRIGHT 2007, Robert W. Gray Page 2 of 11 Encyclopedia Polyhedra: Last Revision: August 5, 2007 RHOMBIC TRIACONTAHEDRON Topology: Vertices = 32 Edges = 60 Faces = 30 diamonds Lengths: 15+ ϕ = 2 EL ≡ Edge length of rhombic Triacontahedron. ϕ + 2 EL = FDL ≅ 0.587 785 252 FDL 2ϕ 3 − ϕ = DVF ϕ 2 FDL ≡ Long face diagonal = DVF ≅ 1.236 067 977 DVF ϕ 2 = EL ≅ 1.701 301 617 EL 3 − ϕ 1 FDS ≡ Short face diagonal = FDL ≅ 0.618 033 989 FDL ϕ 2 = DVF ≅ 0.763 932 023 DVF ϕ 2 2 = EL ≅ 1.051 462 224 EL ϕ + 2 COPYRIGHT 2007, Robert W. Gray Page 3 of 11 Encyclopedia Polyhedra: Last Revision: August 5, 2007 RHOMBIC TRIACONTAHEDRON DFVL ≡ Center of face to vertex at the end of a long face diagonal 1 = FDL 2 1 = DVF ≅ 0.618 033 989 DVF ϕ 1 = EL ≅ 0.850 650 808 EL 3 − ϕ DFVS ≡ Center of face to vertex at the end of a short face diagonal 1 = FDL ≅ 0.309 016 994 FDL 2 ϕ 1 = DVF ≅ 0.381 966 011 DVF ϕ 2 1 = EL ≅ 0.525 731 112 EL ϕ + 2 ϕ + 2 DFE = FDL ≅ 0.293 892 626 FDL 4 ϕ ϕ + 2 = DVF ≅ 0.363 271 264 DVF 21()ϕ + 1 = EL 2 ϕ 3 − ϕ DVVL = FDL ≅ 0.951 056 516 FDL 2 = 3 − ϕ DVF ≅ 1.175 570 505 DVF = ϕ EL ≅ 1.618 033 988 EL COPYRIGHT 2007, Robert W.
    [Show full text]
  • Enhancing Strategic Discourse Systematically Using Climate Metaphors Widespread Comprehension of System Dynamics in Weather Patterns As a Resource -- /
    Alternative view of segmented documents via Kairos 24 August 2015 | Draft Enhancing Strategic Discourse Systematically using Climate Metaphors Widespread comprehension of system dynamics in weather patterns as a resource -- / -- Introduction Systematic global insight of memorable quality? Towards memorable framing of global climate of governance processes? Visual representations of globality of requisite variety for global governance Four-dimensional requisite for a time-bound global civilization? Comprehending the shapes of time through four-dimensional uniform polychora Five-fold ordering of strategic engagement with time Interplay of cognitive patterns in discourse on systemic change Five-fold cognitive dynamics of relevance to governance? Decision-making capacity versus Distinction-making capacity: embodying whether as weather From star-dom to whizdom to isdom? From space-ship design to time-ship embodiment as a requisite metaphor of governance References Prepared in anticipation of the United Nations Climate Change Conference (Paris, 2015) Introduction There is considerable familiarity with the dynamics of climate and weather through the seasons and in different locations. These provide a rich source of metaphor, widely shared, and frequently exploited as a means of communicating subtle insights into social phenomena, strategic options and any resistance to them. It is however now difficult to claim any coherence to the strategic discourse on which humanity and global governance is held to be dependent. This is evident in the deprecation of one political faction by another, the exacerbation of conflictual perceptions by the media, the daily emergence of intractable crises, and the contradictory assertions of those claiming expertise in one arena or another. The dynamics have been caricatured as blame-gaming, as separately discussed (Blame game? It's them not us ! 2015).
    [Show full text]
  • A Tourist Guide to the RCSR
    A tourist guide to the RCSR Some of the sights, curiosities, and little-visited by-ways Michael O'Keeffe, Arizona State University RCSR is a Reticular Chemistry Structure Resource available at http://rcsr.net. It is open every day of the year, 24 hours a day, and admission is free. It consists of data for polyhedra and 2-periodic and 3-periodic structures (nets). Visitors unfamiliar with the resource are urged to read the "about" link first. This guide assumes you have. The guide is designed to draw attention to some of the attractions therein. If they sound particularly attractive please visit them. It can be a nice way to spend a rainy Sunday afternoon. OKH refers to M. O'Keeffe & B. G. Hyde. Crystal Structures I: Patterns and Symmetry. Mineral. Soc. Am. 1966. This is out of print but due as a Dover reprint 2019. POLYHEDRA Read the "about" for hints on how to use the polyhedron data to make accurate drawings of polyhedra using crystal drawing programs such as CrystalMaker (see "links" for that program). Note that they are Cartesian coordinates for (roughly) equal edge. To make the drawing with unit edge set the unit cell edges to all 10 and divide the coordinates given by 10. There seems to be no generally-agreed best embedding for complex polyhedra. It is generally not possible to have equal edge, vertices on a sphere and planar faces. Keywords used in the search include: Simple. Each vertex is trivalent (three edges meet at each vertex) Simplicial. Each face is a triangle.
    [Show full text]
  • Arxiv:1012.2020V1 [Math.CV]
    TRANSITIVITY ON WEIERSTRASS POINTS ZOË LAING AND DAVID SINGERMAN 1. Introduction An automorphism of a Riemann surface will preserve its set of Weier- strass points. In this paper, we search for Riemann surfaces whose automorphism groups act transitively on the Weierstrass points. One well-known example is Klein’s quartic, which is known to have 24 Weierstrass points permuted transitively by it’s automorphism group, PSL(2, 7) of order 168. An investigation of when Hurwitz groups act transitively has been made by Magaard and Völklein [19]. After a section on the preliminaries, we examine the transitivity property on several classes of surfaces. The easiest case is when the surface is hy- perelliptic, and we find all hyperelliptic surfaces with the transitivity property (there are infinitely many of them). We then consider surfaces with automorphism group PSL(2, q), Weierstrass points of weight 1, and other classes of Riemann surfaces, ending with Fermat curves. Basically, we find that the transitivity property property seems quite rare and that the surfaces we have found with this property are inter- esting for other reasons too. 2. Preliminaries Weierstrass Gap Theorem ([6]). Let X be a compact Riemann sur- face of genus g. Then for each point p ∈ X there are precisely g integers 1 = γ1 < γ2 <...<γg < 2g such that there is no meromor- arXiv:1012.2020v1 [math.CV] 9 Dec 2010 phic function on X whose only pole is one of order γj at p and which is analytic elsewhere. The integers γ1,...,γg are called the gaps at p. The complement of the gaps at p in the natural numbers are called the non-gaps at p.
    [Show full text]
  • REFLECTION GROUPS and COXETER GROUPS by Kouver
    REFLECTION GROUPS AND COXETER GROUPS by Kouver Bingham A Senior Honors Thesis Submitted to the Faculty of The University of Utah In Partial Fulfillment of the Requirements for the Honors Degree in Bachelor of Science In Department of Mathematics Approved: Mladen Bestviva Dr. Peter Trapa Supervisor Chair, Department of Mathematics ( Jr^FeraSndo Guevara Vasquez Dr. Sylvia D. Torti Department Honors Advisor Dean, Honors College July 2014 ABSTRACT In this paper we give a survey of the theory of Coxeter Groups and Reflection groups. This survey will give an undergraduate reader a full picture of Coxeter Group theory, and will lean slightly heavily on the side of showing examples, although the course of discussion will be based on theory. We’ll begin in Chapter 1 with a discussion of its origins and basic examples. These examples will illustrate the importance and prevalence of Coxeter Groups in Mathematics. The first examples given are the symmetric group <7„, and the group of isometries of the ^-dimensional cube. In Chapter 2 we’ll formulate a general notion of a reflection group in topological space X, and show that such a group is in fact a Coxeter Group. In Chapter 3 we’ll introduce the Poincare Polyhedron Theorem for reflection groups which will vastly expand our understanding of reflection groups thereafter. We’ll also give some surprising examples of Coxeter Groups that section. Then, in Chapter 4 we’ll make a classification of irreducible Coxeter Groups, give a linear representation for an arbitrary Coxeter Group, and use this complete the fact that all Coxeter Groups can be realized as reflection groups with Tit’s Theorem.
    [Show full text]
  • Conformal Quasicrystals and Holography
    Conformal Quasicrystals and Holography Latham Boyle1, Madeline Dickens2 and Felix Flicker2;3 1Perimeter Institute for Theoretical Physics, Waterloo, Ontario N2L 2Y5, Canada, N2L 2Y5 2Department of Physics, University of California, Berkeley, California 94720, USA 3Rudolf Peierls Centre for Theoretical Physics, University of Oxford, Department of Physics, Clarendon Laboratory, Parks Road, Oxford, OX1 3PU, United Kingdom Recent studies of holographic tensor network models defined on regular tessellations of hyperbolic space have not yet addressed the underlying discrete geometry of the boundary. We show that the boundary degrees of freedom naturally live on a novel structure, a conformal quasicrystal, that pro- vides a discrete model of conformal geometry. We introduce and construct a class of one-dimensional conformal quasicrystals, and discuss a higher-dimensional example (related to the Penrose tiling). Our construction permits discretizations of conformal field theories that preserve an infinite discrete subgroup of the global conformal group at the cost of lattice periodicity. I. INTRODUCTION dom [12{24]. Meanwhile, quantum information theory provides a unifying language for these studies in terms of entanglement, quantum circuits, and quantum error A central topic in theoretical physics over the past two correction [25]. decades has been holography: the idea that a quantum These investigations have gradually clarified our un- theory in a bulk space may be precisely dual to another derstanding of the discrete geometry in the bulk. There living on the boundary of that space. The most concrete has been a common expectation, based on an analogy and widely-studied realization of this idea has been the with AdS/CFT [1{3], that TNs living on discretizations AdS/CFT correspondence [1{3], in which a gravitational of a hyperbolic space define a lattice state of a critical theory living in a (d + 1)-dimensional negatively-curved system on the boundary and vice-versa.
    [Show full text]
  • Arxiv:2105.14305V1 [Cs.CG] 29 May 2021
    Efficient Folding Algorithms for Regular Polyhedra ∗ Tonan Kamata1 Akira Kadoguchi2 Takashi Horiyama3 Ryuhei Uehara1 1 School of Information Science, Japan Advanced Institute of Science and Technology (JAIST), Ishikawa, Japan fkamata,[email protected] 2 Intelligent Vision & Image Systems (IVIS), Tokyo, Japan [email protected] 3 Faculty of Information Science and Technology, Hokkaido University, Hokkaido, Japan [email protected] Abstract We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra, also known as Platonic solids. The basic idea of our algorithms is common, which is called stamping. However, the computational complexities of them are different depending on their geometric properties. We developed four algorithms for the problem as follows. (1) An algorithm for a regular tetrahedron, which can be extended to a tetramonohedron. (2) An algorithm for a regular hexahedron (or a cube), which is much efficient than the previously known one. (3) An algorithm for a general deltahedron, which contains the cases that Q is a regular octahedron or a regular icosahedron. (4) An algorithm for a regular dodecahedron. Combining these algorithms, we can conclude that the folding problem can be solved pseudo-polynomial time when Q is a regular polyhedron and other related solid. Keywords: Computational origami folding problem pseudo-polynomial time algorithm regular poly- hedron (Platonic solids) stamping 1 Introduction In 1525, the German painter Albrecht D¨urerpublished his masterwork on geometry [5], whose title translates as \On Teaching Measurement with a Compass and Straightedge for lines, planes, and whole bodies." In the book, he presented each polyhedron by drawing a net, which is an unfolding of the surface of the polyhedron to a planar layout without overlapping by cutting along its edges.
    [Show full text]
  • Tessellations: Lessons for Every Age
    TESSELLATIONS: LESSONS FOR EVERY AGE A Thesis Presented to The Graduate Faculty of The University of Akron In Partial Fulfillment of the Requirements for the Degree Master of Science Kathryn L. Cerrone August, 2006 TESSELLATIONS: LESSONS FOR EVERY AGE Kathryn L. Cerrone Thesis Approved: Accepted: Advisor Dean of the College Dr. Linda Saliga Dr. Ronald F. Levant Faculty Reader Dean of the Graduate School Dr. Antonio Quesada Dr. George R. Newkome Department Chair Date Dr. Kevin Kreider ii ABSTRACT Tessellations are a mathematical concept which many elementary teachers use for interdisciplinary lessons between math and art. Since the tilings are used by many artists and masons many of the lessons in circulation tend to focus primarily on the artistic part, while overlooking some of the deeper mathematical concepts such as symmetry and spatial sense. The inquiry-based lessons included in this paper utilize the subject of tessellations to lead students in developing a relationship between geometry, spatial sense, symmetry, and abstract algebra for older students. Lesson topics include fundamental principles of tessellations using regular polygons as well as those that can be made from irregular shapes, symmetry of polygons and tessellations, angle measurements of polygons, polyhedra, three-dimensional tessellations, and the wallpaper symmetry groups to which the regular tessellations belong. Background information is given prior to the lessons, so that teachers have adequate resources for teaching the concepts. The concluding chapter details results of testing at various age levels. iii ACKNOWLEDGEMENTS First and foremost, I would like to thank my family for their support and encourage- ment. I would especially like thank Chris for his patience and understanding.
    [Show full text]