DOCSLIB.ORG

Hexagonal Antiprism Tetragonal Bipyramid Dodecahedron

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Hexagonal Antiprism Tetragonal Bipyramid Dodecahedron Call List hexagonal antiprism tetragonal bipyramid dodecahedron hemisphere icosahedron cube triangular bipyramid sphere octahedron cone triangular prism pentagonal bipyramid torus cylinder square­based pyramid octagonal prism cuboid hexagonal prism pentagonal prism tetrahedron cube octahedron square antiprism ellipsoid pentagonal antiprism spheroid Created using www.BingoCardPrinter.com B I N G O hexagonal triangular square­based tetrahedron antiprism cube prism pyramid tetragonal triangular pentagonal octagonal cube bipyramid bipyramid bipyramid prism octahedron Free square dodecahedron sphere Space cuboid antiprism hexagonal hemisphere octahedron torus prism ellipsoid pentagonal pentagonal icosahedron cone cylinder prism antiprism Created using www.BingoCardPrinter.com B I N G O triangular pentagonal triangular hemisphere cube prism antiprism bipyramid pentagonal hexagonal tetragonal torus bipyramid prism bipyramid cone square Free hexagonal octagonal tetrahedron antiprism Space antiprism prism square­based dodecahedron ellipsoid cylinder octahedron pyramid pentagonal icosahedron sphere prism cuboid spheroid Created using www.BingoCardPrinter.com B I N G O cube hexagonal triangular icosahedron octahedron prism torus prism octagonal square dodecahedron hemisphere spheroid prism antiprism Free pentagonal octahedron square­based pyramid Space cube antiprism hexagonal pentagonal triangular cone antiprism cuboid bipyramid bipyramid tetragonal cylinder tetrahedron ellipsoid bipyramid sphere Created using www.BingoCardPrinter.com B I N G O triangular cylinder octahedron bipyramid cube sphere square octagonal triangular hexagonal antiprism prism cone prism antiprism Free tetragonal ellipsoid hemisphere torus Space bipyramid pentagonal pentagonal pentagonal dodecahedron antiprism bipyramid prism spheroid cube square­based hexagonal icosahedron octahedron cuboid pyramid prism Created using www.BingoCardPrinter.com B I N G O pentagonal hexagonal octagonal octahedron bipyramid cube antiprism prism tetragonal tetrahedron hemisphere bipyramid sphere cone cube Free hexagonal dodecahedron spheroid octahedron Space prism triangular icosahedron cylinder cuboid bipyramid torus triangular pentagonal square square­based ellipsoid prism prism antiprism pyramid Created using www.BingoCardPrinter.com B I N G O hexagonal pentagonal octahedron icosahedron hemisphere prism bipyramid octagonal square sphere tetrahedron cone prism antiprism Free triangular triangular dodecahedron ellipsoid Space bipyramid prism pentagonal pentagonal torus antiprism cylinder spheroid prism cube tetragonal hexagonal cuboid octahedron bipyramid antiprism cube Created using www.BingoCardPrinter.com B I N G O square­based pentagonal sphere pyramid cone prism ellipsoid pentagonal hexagonal triangular pentagonal cuboid bipyramid antiprism prism antiprism square Free octagonal icosahedron antiprism Space torus prism hexagonal dodecahedron hemisphere cylinder spheroid prism tetragonal cube triangular octahedron bipyramid octahedron cube bipyramid Created using www.BingoCardPrinter.com B I N G O octagonal triangular spheroid octahedron prism prism cube triangular square­based tetragonal dodecahedron bipyramid pyramid bipyramid sphere Free ellipsoid hexagonal pentagonal torus Space prism bipyramid pentagonal pentagonal square icosahedron hemisphere prism antiprism antiprism cube hexagonal cylinder tetrahedron octahedron cone antiprism Created using www.BingoCardPrinter.com.
Load more

Recommended publications
  • The Volumes of a Compact Hyperbolic Antiprism
    The volumes of a compact hyperbolic antiprism Vuong Huu Bao joint work with Nikolay Abrosimov Novosibirsk State University G2R2 August 6-18, Novosibirsk, 2018 Vuong Huu Bao (NSU) The volumes of a compact hyperbolic antiprism Aug. 6-18,2018 1/14 Introduction Calculating volumes of polyhedra is a classical problem, that has been well known since Euclid and remains relevant nowadays. This is partly due to the fact that the volume of a fundamental polyhedron is one of the main geometrical invariants for a 3-dimensional manifold. Every 3-manifold can be presented by a fundamental polyhedron. That means we can pair-wise identify the faces of some polyhedron to obtain a 3-manifold. Thus the volume of 3-manifold is the volume of prescribed fundamental polyhedron. Theorem (Thurston, Jørgensen) The volumes of hyperbolic 3-dimensional hyperbolic manifolds form a closed non-discrete set on the real line. This set is well ordered. There are only finitely many manifolds with a given volume. Vuong Huu Bao (NSU) The volumes of a compact hyperbolic antiprism Aug. 6-18,2018 2/14 Introduction 1835, Lobachevsky and 1982, Milnor computed the volume of an ideal hyperbolic tetrahedron in terms of Lobachevsky function. 1993, Vinberg computed the volume of hyperbolic tetrahedron with at least one vertex at infinity. 1907, Gaetano Sforza; 1999, Yano, Cho ; 2005 Murakami; 2005 Derevnin, Mednykh gave different formulae for general hyperbolic tetrahedron. 2009, N. Abrosimov, M. Godoy and A. Mednykh found the volumes of spherical octahedron with mmm or 2 m-symmetry. | 2013, N. Abrosimov and G. Baigonakova, found the volume of hyperbolic octahedron with mmm-symmetry.
    [Show full text]
  • Uniform Polychora
    BRIDGES Mathematical Connections in Art, Music, and Science Uniform Polychora Jonathan Bowers 11448 Lori Ln Tyler, TX 75709 E-mail: [email protected] Abstract Like polyhedra, polychora are beautiful aesthetic structures - with one difference - polychora are four dimensional. Although they are beyond human comprehension to visualize, one can look at various projections or cross sections which are three dimensional and usually very intricate, these make outstanding pieces of art both in model form or in computer graphics. Polygons and polyhedra have been known since ancient times, but little study has gone into the next dimension - until recently. Definitions A polychoron is basically a four dimensional "polyhedron" in the same since that a polyhedron is a three dimensional "polygon". To be more precise - a polychoron is a 4-dimensional "solid" bounded by cells with the following criteria: 1) each cell is adjacent to only one other cell for each face, 2) no subset of cells fits criteria 1, 3) no two adjacent cells are corealmic. If criteria 1 fails, then the figure is degenerate. The word "polychoron" was invented by George Olshevsky with the following construction: poly = many and choron = rooms or cells. A polytope (polyhedron, polychoron, etc.) is uniform if it is vertex transitive and it's facets are uniform (a uniform polygon is a regular polygon). Degenerate figures can also be uniform under the same conditions. A vertex figure is the figure representing the shape and "solid" angle of the vertices, ex: the vertex figure of a cube is a triangle with edge length of the square root of 2.
    [Show full text]
  • The View from Six Dimensions
    Walls and Bridges The view from Six Dimensiosn Wendy Y. Krieger [email protected] ∗ January, Abstract Walls divide, bridges unite. This idea is applied to devising a vocabulary suited for the study of higher dimensions. Points are connected, solids divided. In higher dimensions, there are many more products and concepts visible. The four polytope products (prism, tegum, pyramid and comb), lacing and semiate figures, laminates are all discussed. Many of these become distinct in four to six dimensions. Walls and Bridges Consider a knife. Its main action is to divide solids into pieces. This is done by a sweeping action, although the presence of solid materials might make the sweep a little less graceful. What might a knife look like in four dimensions. A knife would sweep a three-dimensional space, and thus the blade is two-dimensional. The purpose of the knife is to divide, and therefore its dimension is fixed by what it divides. Walls divide, bridges unite. When things are thought about in the higher dimensions, the dividing or uniting nature of it is more important than its innate dimensionality. A six-dimensional blade has four dimensions, since its sweep must make five dimensions. There are many idioms that suggest the role of an edge or line is to divide. This most often hap pens when the referent dimension is the two-dimensional ground, but the edge of a knife makes for a three-dimensional referent. A line in the sand, a deadline, and to the edge, all suggest boundaries of two-dimensional areas, where the line or edge divides.
    [Show full text]
  • Systematics of Atomic Orbital Hybridization of Coordination Polyhedra: Role of F Orbitals
    molecules Article Systematics of Atomic Orbital Hybridization of Coordination Polyhedra: Role of f Orbitals R. Bruce King Department of Chemistry, University of Georgia, Athens, GA 30602, USA; [email protected] Academic Editor: Vito Lippolis Received: 4 June 2020; Accepted: 29 June 2020; Published: 8 July 2020 Abstract: The combination of atomic orbitals to form hybrid orbitals of special symmetries can be related to the individual orbital polynomials. Using this approach, 8-orbital cubic hybridization can be shown to be sp3d3f requiring an f orbital, and 12-orbital hexagonal prismatic hybridization can be shown to be sp3d5f2g requiring a g orbital. The twists to convert a cube to a square antiprism and a hexagonal prism to a hexagonal antiprism eliminate the need for the highest nodality orbitals in the resulting hybrids. A trigonal twist of an Oh octahedron into a D3h trigonal prism can involve a gradual change of the pair of d orbitals in the corresponding sp3d2 hybrids. A similar trigonal twist of an Oh cuboctahedron into a D3h anticuboctahedron can likewise involve a gradual change in the three f orbitals in the corresponding sp3d5f3 hybrids. Keywords: coordination polyhedra; hybridization; atomic orbitals; f-block elements 1. Introduction In a series of papers in the 1990s, the author focused on the most favorable coordination polyhedra for sp3dn hybrids, such as those found in transition metal complexes. Such studies included an investigation of distortions from ideal symmetries in relatively symmetrical systems with molecular orbital degeneracies [1] In the ensuing quarter century, interest in actinide chemistry has generated an increasing interest in the involvement of f orbitals in coordination chemistry [2–7].
    [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]
  • Uniform Panoploid Tetracombs
    Uniform Panoploid Tetracombs George Olshevsky TETRACOMB is a four-dimensional tessellation. In any tessellation, the honeycells, which are the n-dimensional polytopes that tessellate the space, Amust by definition adjoin precisely along their facets, that is, their ( n!1)- dimensional elements, so that each facet belongs to exactly two honeycells. In the case of tetracombs, the honeycells are four-dimensional polytopes, or polychora, and their facets are polyhedra. For a tessellation to be uniform, the honeycells must all be uniform polytopes, and the vertices must be transitive on the symmetry group of the tessellation. Loosely speaking, therefore, the vertices must be “surrounded all alike” by the honeycells that meet there. If a tessellation is such that every point of its space not on a boundary between honeycells lies in the interior of exactly one honeycell, then it is panoploid. If one or more points of the space not on a boundary between honeycells lie inside more than one honeycell, the tessellation is polyploid. Tessellations may also be constructed that have “holes,” that is, regions that lie inside none of the honeycells; such tessellations are called holeycombs. It is possible for a polyploid tessellation to also be a holeycomb, but not for a panoploid tessellation, which must fill the entire space exactly once. Polyploid tessellations are also called starcombs or star-tessellations. Holeycombs usually arise when (n!1)-dimensional tessellations are themselves permitted to be honeycells; these take up the otherwise free facets that bound the “holes,” so that all the facets continue to belong to two honeycells. In this essay, as per its title, we are concerned with just the uniform panoploid tetracombs.
    [Show full text]
  • Chains of Antiprisms
    Chains of antiprisms Citation for published version (APA): Verhoeff, T., & Stoel, M. (2015). Chains of antiprisms. In Bridges Baltimore 2015 : Mathematics, Music, Art, Architecture, Culture, Baltimore, MD, USA, July 29 - August 1, 2015 (pp. 347-350). The Bridges Organization. Document status and date: Published: 01/01/2015 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.
    [Show full text]
  • Hwsolns5scan.Pdf
    Math 462: Homework 5 Paul Hacking 3/27/10 (1) One way to describe a polyhedron is by cutting along some of the edges and folding it flat in the plane. The diagram obtained in this way is called a net. For example here is a net for the cube: Draw nets for the tetrahedron, octahedron, and dodecahedron. +~tfl\ h~~1l1/\ \(j [ NJte: T~ i) Mq~ u,,,,, cMi (O/r.(J 1 (2) Another way to describe a polyhedron is as follows: imagine that the faces of the polyhedron arc made of glass, look through one of the faces and draw the image you see of the remaining faces of the polyhedron. This image is called a Schlegel diagram. For example here is a Schlegel diagram for the octahedron. Note that the face you are looking through is not. drawn, hut the boundary of that face corresponds to the boundary of the diagram. Now draw a Schlegel diagram for the dodecahedron. (:~) (a) A pyramid is a polyhedron obtained from a. polygon with Rome number n of sides by joining every vertex of the polygon to a point lying above the plane of the polygon. The polygon is called the base of the pyramid and the additional vertex is called the apex, For example the Egyptian pyramids have base a square (so n = 4) and the tetrahedron is a pyramid with base an equilateral 2 I triangle (so n = 3). Compute the number of vertices, edges; and faces of a pyramid with base a polygon with n Rides. (b) A prism is a polyhedron obtained from a polygon (called the base of the prism) as follows: translate the polygon some distance in the direction normal to the plane of the polygon, and join the vertices of the original polygon to the corresponding vertices of the translated polygon.
    [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]
  • A Fast and Robust Coordination Environment Identification Tool
    doi.org/10.26434/chemrxiv.11294480.v1 ChemEnv : A Fast and Robust Coordination Environment Identification Tool David Waroquiers, Janine George, Matthew Horton, Stephan Schenk, Kristin Persson, Gian-Marco Rignanese, Xavier Gonze, Geoffroy Hautier Submitted date: 28/11/2019 • Posted date: 17/12/2019 Licence: CC BY-NC-ND 4.0 Citation information: Waroquiers, David; George, Janine; Horton, Matthew; Schenk, Stephan; Persson, Kristin; Rignanese, Gian-Marco; et al. (2019): ChemEnv : A Fast and Robust Coordination Environment Identification Tool. ChemRxiv. Preprint. https://doi.org/10.26434/chemrxiv.11294480.v1 Coordination or local environments have been used to describe, analyze, and understand crystal structures for more than a century. Here, we present a new tool called ChemEnv, which can identify coordination environments in a fast and robust manner. In contrast to previous tools, the assessment of the coordination environments is not biased by small distortions of the crystal structure. Its robust and fast implementation enables the analysis of large databases of structures. The code is available open source within the pymatgen package and the software can as well be used through a web app available on http://crystaltoolkit.org through the Materials Project. File list (2) paper.pdf (4.27 MiB) view on ChemRxiv download file supplementary_information.pdf (159.36 KiB) view on ChemRxiv download file 1 ChemEnv : A fast and robust coordination environment identification tool David Waroquiers,a Janine George,a Matthew Horton,b;c Stephan Schenk,d Kristin A. Persson,b;c Gian-Marco Rignanese,a Xavier Gonzea;e and Geoffroy Hautier a* aInstitute of Condensed Matter and Nanosciences, Universit´ecatholique de Louvain, Chemin des Etoiles´ 8, 1348 Louvain-la-Neuve, Belgium, bEnergy Technologies Area, Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA, cDepartment of Materials Science and Engineering, University of California, Berkeley, CA 94720, USA, dBASF SE, Digitalization of R&D, Carl-Bosch-Str.
    [Show full text]
  • Convex Polytopes and Tilings with Few Flag Orbits
    Convex Polytopes and Tilings with Few Flag Orbits by Nicholas Matteo B.A. in Mathematics, Miami University M.A. in Mathematics, Miami University A dissertation submitted to The Faculty of the College of Science of Northeastern University in partial fulfillment of the requirements for the degree of Doctor of Philosophy April 14, 2015 Dissertation directed by Egon Schulte Professor of Mathematics Abstract of Dissertation The amount of symmetry possessed by a convex polytope, or a tiling by convex polytopes, is reflected by the number of orbits of its flags under the action of the Euclidean isometries preserving the polytope. The convex polytopes with only one flag orbit have been classified since the work of Schläfli in the 19th century. In this dissertation, convex polytopes with up to three flag orbits are classified. Two-orbit convex polytopes exist only in two or three dimensions, and the only ones whose combinatorial automorphism group is also two-orbit are the cuboctahedron, the icosidodecahedron, the rhombic dodecahedron, and the rhombic triacontahedron. Two-orbit face-to-face tilings by convex polytopes exist on E1, E2, and E3; the only ones which are also combinatorially two-orbit are the trihexagonal plane tiling, the rhombille plane tiling, the tetrahedral-octahedral honeycomb, and the rhombic dodecahedral honeycomb. Moreover, any combinatorially two-orbit convex polytope or tiling is isomorphic to one on the above list. Three-orbit convex polytopes exist in two through eight dimensions. There are infinitely many in three dimensions, including prisms over regular polygons, truncated Platonic solids, and their dual bipyramids and Kleetopes. There are infinitely many in four dimensions, comprising the rectified regular 4-polytopes, the p; p-duoprisms, the bitruncated 4-simplex, the bitruncated 24-cell, and their duals.
    [Show full text]