Zipper Unfoldings of Polyhedral Complexes. Erik Demaine Martin Demaine Anna Lubiw Arlo Shallit Jonah Shallit
|
|
- Jordan Cobb
- 5 years ago
- Views:
Transcription
1 Zipper Unfoldings of Polyhedral Complexes Erik Demaine Martin Demaine Anna Lubiw Arlo Shallit Jonah Shallit 1
2 Unfolding Polyhedra Durer 1400 s Durer, 1498 snub cube 2
3 Unfolding Polyhedra Octahedron all unfoldings 3
4 4
5 Zipper Unfoldings of Polyhedra Octahedron 5
6 Zippers separating zipper multiple toggles (cosmetic) 6
7 Zippers 1891 patent by Whitcomb Judson novel, but not practical ( If skirt is to be washed, remove fastener. ) named zipper by B.F. Goodrich company in 1920 s ubiquitous but superfluous 7
8 Edge Cuts versus Face Cuts edge cuts face cuts Zipper edge cuts = Hamiltonian unfolding [Shepherd 75] 8
9 Zipper Edge Cuts (Hamiltonian Unfolding) What is a zipper unfolding of a polyhedron? on the polyhedron the cut is a simple path on the polygon this is forbidden Nick Chase 9
10 Outline of Talk Convex Polyhedra Platonic Solids Archimedean Solids Polyhedral Manifolds Polyhedral Complexes 10
11 Platonic Solids 12
12 Platonic Solids These are doubly Hamiltonian the cut is a path and faces are joined in a path. 13
13 Archimedean Solids great rhombicosidodecahedron truncated tetrahedron truncated dodecahedron truncated cube truncated icosahedron truncated octahedron great rhombicuboctahedron small rhombicosidodecahedron snub cube small rhombicuboctahedron cuboctahedron icosidodecahedron snub dodecahedron 14
14 Archimedean Solids great rhombicosidodecahedron truncated tetrahedron truncated dodecahedron truncated cube truncated icosahedron truncated octahedron great rhombicuboctahedron small rhombicosidodecahedron snub cube small rhombicuboctahedron cuboctahedron icosidodecahedron snub dodecahedron 15
15 Archimedean Solids great rhombicosidodecahedron 16
16 Archimedean Solids great rhombicosidodecahedron truncated tetrahedron truncated dodecahedron truncated cube truncated icosahedron truncated octahedron great rhombicuboctahedron small rhombicosidodecahedron snub cube small rhombicuboctahedron cuboctahedron icosidodecahedron snub dodecahedron 18
17 What next? these have zipper unfoldings?? Peda Software Polyhedron Poster 19
18 Not all convex polyhedra have Hamiltonian unfoldings rhombic dodecahedron net its graph has no Hamiltonian path OPEN: find a convex polyhedron with no Hamiltonian unfolding but whose graph has a Hamiltonian path. 20
19 Unfolding Convex Polyhedra unfolding zipper unfolding face cuts YES Every convex polyhedron has an unfolding star, source unfolding. OPEN Does every convex polyhedron have a zipper unfolding? edge cuts OPEN Does every convex polyhedron have an edge unfolding? NO Not every convex polyhedron has a Hamiltonian unfolding. 21
20 Polyhedral Manifolds polyhedral manifold a finite union of planar polygons in 3D s.t. every point has a neighbourhood homeomorphic to a disk may be non-convex may have genus 0 Magnus Wenninger 22
21 ers of the tetrahedron. So we have these four corners s inside the hats. Viewing each of these four paths, we can see that it is impossible to avoid a cycle, 1 arcs. This violates Lemma , and establishes e unfolding to a net. hedron can be unfolded without restricting the cuts tegy (for a differently parametrized version of the kes safely out to the boundary of the tetrahedron Polyhedral Manifolds Unfolding nnot be unfolded without overlap: a nice non-convex polyhedron with no edge unfolding some higher genus polyhedral manifolds with edge unfoldings Donoso & O Rourke an ununfoldable triangulated polyhedron. Bern, Demaine, Eppstein, Kuo, Mantler, Snoeyink, Császár torus (net by Lutz, picture by Polthier) OPEN: Does every polyhedral manifold have a [general] unfolding? x C 23
22 Polyhedral Manifolds Zipper Unfoldings use separating zipper 24
23 Polyhedral Manifolds Zipper Unfoldings Theorem. If P is a polyhedral manifold that has a zipper unfolding to a planar polygonal region F, then either P is a polyhedron and F is a polygon, or in the case of a separating zipper P is a torus polyhedron and F is an annulus (with outer perimeter = inner perimeter). not possible Nick Chase 25
24 Polyhedral Manifolds Zipper Unfoldings These have no zipper edge unfoldings. Lemma. A zipper edge unfolding of a torus polyhedron is an annulus with faces forming a cycle with trees attached. 26
25 Polyhedral Complexes polyhedral complex a finite union of planar polygons in 3D s.t. intersections are edge-to-edge joins only one face at an edge 3 faces meeting at an edge Weaire Phelan structure 27
26 Polyhedral Complexes Unfolding cannot be unfolded v Bern, Demaine, Eppstein, Kuo, Mantler, Snoeyink, Liu & Tai, in Computer-Aided Design,
27 Polyhedral Complexes Unfolding What does unfolding mean when multiple faces meet at an edge? valid (c) Valid spanning tree. invalid (b) Invalid spanning tree. Liu & Tai, in Computer-Aided Design,
28 Polyhedral Complexes Zipper Unfolding not allowed on the polygon 30
29 Polyhedral Complexes Zipper Unfolding 31
30 Polyhedral Complexes Zipper Unfolding Polyhedra Sharing Faces 2 tetrahedra what will this zip into? 32
31 Polyhedral Complexes Zipper Unfolding Polyhedra Sharing Faces 2 cubes seems impossible 2 squashed cubes 33
32 Polyhedral Complexes Zipper Unfolding Polyhedra Sharing Edges chain of tetrahedra sharing adjacent edges can extend to n tetrahedra 34
33 Polyhedral Complexes Zipper Unfolding 35
34 Open Problems Does every convex polyhedron have an edge unfolding? Does every polyhedron have a [general] unfolding? Every polyhedral manifold? New: Does every convex polyhedron have a zipper unfolding? Show it s NP-hard to recognize torus polyhedra with zipper edge unfoldings. Which polyhedral complexes have [zipper/edge] unfoldings? 36
35 Zipper Unfoldings of Polyhedral Complexes Erik Demaine Martin Demaine Anna Lubiw Arlo Shallit Jonah Shallit 37
Zipper Unfoldings of Polyhedral Complexes
Zipper Unfoldings of Polyhedral Complexes Erik D. Demaine Martin L. Demaine Anna Lubiw Arlo Shallit Jonah L. Shallit Abstract We explore which polyhedra and polyhedral complexes can be formed by folding
More informationPolyhedra. Kavitha d/o Krishnan
Polyhedra Kavitha d/o Krishnan Supervisor: Associate Professor Helmer Aslaksen Department of Mathematics National University of Singapore Semester I 2001/2002 Abstract Introduction The report focuses on
More informationLecture 3: Partitioning Polygons & Polyhedra CS 763 F16. Polyhedra
CS 763 F16 Polyhedra dice, Pompei, 1st century icosahedral die, Roman, 2nd century - 47 - CS 763 F16 Polyhedra Platonic solids cuboctahedron Pentagonal orthocupolarotunda polycrystalline morphology - 48
More informationSpiral Unfoldings of Convex Polyhedra
Spiral Unfoldings of Convex Polyhedra Joseph O Rourke arxiv:509.0032v2 [cs.cg] 9 Oct 205 October 20, 205 Abstract The notion of a spiral unfolding of a convex polyhedron, a special type of Hamiltonian
More informationA Topologically Convex Vertex-Ununfoldable Polyhedron
A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel 1 Erik D. Demaine 2 Martin L. Demaine 2 1 MIT Department of Mathematics 2 MIT CSAIL CCCG 2011 Abel, Demaine, and Demaine (MIT) A Vertex-Ununfoldable
More informationRefold rigidity of convex polyhedra
Refold rigidity of convex polyhedra The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Demaine, Erik
More informationEuler Characteristic
Euler Characteristic Rebecca Robinson May 15, 2007 Euler Characteristic Rebecca Robinson 1 PLANAR GRAPHS 1 Planar graphs v = 5, e = 4, f = 1 v e + f = 2 v = 6, e = 7, f = 3 v = 4, e = 6, f = 4 v e + f
More informationWeek 7 Convex Hulls in 3D
1 Week 7 Convex Hulls in 3D 2 Polyhedra A polyhedron is the natural generalization of a 2D polygon to 3D 3 Closed Polyhedral Surface A closed polyhedral surface is a finite set of interior disjoint polygons
More informationarxiv:submit/ [cs.cg] 8 Jun 2011
Common Edge-Unzippings for Tetrahedra Joseph O Rourke arxiv:submit/68 [cs.cg] 8 Jun June 8, Abstract It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which
More informationMap-colouring with Polydron
Map-colouring with Polydron The 4 Colour Map Theorem says that you never need more than 4 colours to colour a map so that regions with the same colour don t touch. You have to count the region round the
More informationof Nebraska - Lincoln
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2008 Archimedean Solids Anna Anderson University of
More informationEdge Unfoldings of Platonic Solids Never Overlap
Edge Unfoldings of Platonic Solids Never Overlap Takashi Horiyama (Saitama Univ.) joint work with Wataru Shoji 1 Unfolding Simple polygon unfolded by cutting along the surface of a polyhedron Two kinds
More informationThe Construction of Uniform Polyhedron with the aid of GeoGebra
The Construction of Uniform Polyhedron with the aid of GeoGebra JiangPing QiuFaWen 71692686@qq.com 3009827@qq.com gifted Department High-school northeast yucai school northeast yucai school 110179 110179
More informationVERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS. ERIK D. DEMAINE MIT Laboratory for Computer Science, 200 Technology
VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS ERIK D. DEMAINE MIT Laboratory for Computer Science, 200 Technology Square, Cambridge, MA 02139, USA. DAVID EPPSTEIN 1 Department of Information and Computer Science,
More informationMath 311. Polyhedra Name: A Candel CSUN Math
1. A polygon may be described as a finite region of the plane enclosed by a finite number of segments, arranged in such a way that (a) exactly two segments meets at every vertex, and (b) it is possible
More informationExample: The following is an example of a polyhedron. Fill the blanks with the appropriate answer. Vertices:
11.1: Space Figures and Cross Sections Polyhedron: solid that is bounded by polygons Faces: polygons that enclose a polyhedron Edge: line segment that faces meet and form Vertex: point or corner where
More informationLeonardo s Elevated Polyhedra - Models
Leonardo s Elevated Polyhedra - Models Rinus Roelofs Lansinkweg 28 7553AL Hengelo The Netherlands E-mail: rinus@rinusroelofs.nl www.rinusroelofs.nl Information Rinus Roelofs was born in 1954. After studying
More informationDepartment of Mathematics, Box University of Washington Seattle, WA
Geombinatorics 11(2001), 43 48. A starshaped polyhedron with no net Branko Grünbaum Department of Mathematics, Box 354350 University of Washington Seattle, WA 98195-4350 e-mail: grunbaum@math.washington.edu
More informationNon-flat tilings with flat tiles
Non-flat tilings with flat tiles Rinus Roelofs Sculptor Lansinkweg 28 7553AL Hengelo The Netherlands E-mail: rinus@rinusroelofs.nl www.rinusroelofs.nl Abstract In general a tiling is considered to be a
More informationEdge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete
CCCG 2011, Toronto ON, August 10 12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel Erik D. Demaine Abstract We prove that it is strongly NP-complete to decide whether a
More informationQuestion. Why is the third shape not convex?
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationMath 210 Manifold III, Spring 2018 Euler Characteristics of Surfaces Hirotaka Tamanoi
Math 210 Manifold III, Spring 2018 Euler Characteristics of Surfaces Hirotaka Tamanoi 1. Euler Characteristic of Surfaces Leonhard Euler noticed that the number v of vertices, the number e of edges and
More informationACTUALLY DOING IT : an Introduction to Polyhedral Computation
ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2
More informationDual Models: One Shape to Make Them All
Bridges Finland Conference Proceedings Dual Models: One Shape to Make Them All Mircea Draghicescu ITSPHUN LLC mircea@itsphun.com Abstract We show how a potentially infinite number of 3D decorative objects
More informationLecture 19: Introduction To Topology
Chris Tralie, Duke University 3/24/2016 Announcements Group Assignment 2 Due Wednesday 3/30 First project milestone Friday 4/8/2016 Welcome to unit 3! Table of Contents The Euler Characteristic Spherical
More informationConvex Hulls (3D) O Rourke, Chapter 4
Convex Hulls (3D) O Rourke, Chapter 4 Outline Polyhedra Polytopes Euler Characteristic (Oriented) Mesh Representation Polyhedra Definition: A polyhedron is a solid region in 3D space whose boundary is
More informationJordan Curves. A curve is a subset of IR 2 of the form
Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0,1]}, where γ : [0,1] IR 2 is a continuous mapping from the closed interval [0,1] to the plane. γ(0) and γ(1) are called the endpoints
More informationOne simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares.
Berkeley Math Circle Intermediate I, 1/23, 1/20, 2/6 Presenter: Elysée Wilson-Egolf Topic: Polygons, Polyhedra, Polytope Series Part 1 Polygon Angle Formula Let s start simple. How do we find the sum of
More informationConnected Holes. Rinus Roelofs Sculptor Lansinkweg AL Hengelo The Netherlands
Connected Holes Rinus Roelofs Sculptor Lansinkweg 28 7553AL Hengelo The Netherlands E-mail: rinus@rinusroelofs.nl www.rinusroelofs.nl Abstract It is possible to make interwoven structures by using two
More informationTopological Issues in Hexahedral Meshing
Topological Issues in Hexahedral Meshing David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science Outline I. What is meshing? Problem statement Types of mesh Quality issues
More informationElevations and Stellations
Proceedings of Bridges 2014: Mathematics, Music, Art, Architecture, Culture Elevations and Stellations Rinus Roelofs Lansinkweg 28 7553AL Hengelo The Netherlands E-mail: rinus@rinusroelofs.nl www.rinusroelofs.nl
More informationFive Platonic Solids: Three Proofs
Five Platonic Solids: Three Proofs Vincent J. Matsko IMSA, Dodecahedron Day Workshop 18 November 2011 Convex Polygons convex polygons nonconvex polygons Euler s Formula If V denotes the number of vertices
More informationON THE ARCHIMEDEAN OR SEMIREGULAR POLYHEDRA
ON THE ARCHIMEDEAN OR SEMIREGULAR POLYHEDRA arxiv:math/0505488v1 [math.gt] 4 May 005 Mark B. Villarino Depto. de Matemática, Universidad de Costa Rica, 060 San José, Costa Rica May 11, 005 Abstract We
More informationDate: Wednesday, 18 January :00AM. Location: Barnard's Inn Hall
Wallpaper Patterns and Buckyballs Transcript Date: Wednesday, 18 January 2006-12:00AM Location: Barnard's Inn Hall WALLPAPER PATTERNS AND BUCKYBALLS Professor Robin Wilson My lectures this term will be
More informationOperations on Maps. Mircea V. Diudea. Faculty of Chemistry and Chemical Engineering Babes-Bolyai
Operations on Maps Mircea V. Diudea Faculty of Chemistry and Chemical Engineering Babes-Bolyai Bolyai University 400028 Cluj,, ROMANIA diudea@chem.ubbcluj.ro 1 Contents Cage Building by Map Operations
More informationUnunfoldable Polyhedra with Convex Faces
Ununfoldable Polyhedra with Convex Faces arxiv:cs/9908003v2 [cs.cg] 27 Aug 2001 Marshall Bern Erik D. Demaine David Eppstein Eric Kuo Andrea Mantler Jack Snoeyink Abstract Unfolding a convex polyhedron
More informationChapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings
Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition
More informationEdge unfolding Cut sets Source foldouts Proof and algorithm Complexity issues Aleksandrov unfolding? Unfolding polyhedra.
Unfolding polyhedra Ezra Miller University of Minnesota ezra@math.umn.edu University of Nebraska 27 April 2007 Outline 1. Edge unfolding 2. Cut sets 3. Source foldouts 4. Proof and algorithm 5. Complexity
More informationarxiv: v1 [math.co] 15 Apr 2018
REGULAR POLYGON SURFACES IAN M. ALEVY arxiv:1804.05452v1 [math.co] 15 Apr 2018 Abstract. A regular polygon surface M is a surface graph (Σ, Γ) together with a continuous map ψ from Σ into Euclidean 3-space
More informationRegular polytopes Notes for talks given at LSBU, November & December 2014 Tony Forbes
Regular polytopes Notes for talks given at LSBU, November & December 2014 Tony Forbes Flags A flag is a sequence (f 1, f 0,..., f n ) of faces f i of a polytope f n, each incident with the next, with precisely
More informationTomáš Madaras and Pavol Široczki
Opuscula Math. 34, no. 1 (014), 13 138 http://dx.doi.org/10.7494/opmath.014.34.1.13 Opuscula Mathematica ON THE DIMENSION OF ARCHIMEDEAN SOLIDS Tomáš Madaras and Pavol Široczki Communicated by Mariusz
More information1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationTriangles and Squares David Eppstein, ICS Theory Group, April 20, 2001
Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001 Which unit-side-length convex polygons can be formed by packing together unit squares and unit equilateral triangles? For instance
More informationUnfolding Prismatoids as Convex Patches: Counterexamples and Positive Results
CCCG 2012, Charlottetown, P.E.I., August 8 10, 2012 Unfolding Prismatoids as Convex Patches: Counterexamples and Positive Results Joseph O Rourke Abstract We address the unsolved problem of unfolding prismatoids
More informationarxiv: v1 [cs.cg] 9 May 2012
CCCG 2012, Charlottetown, P.E.I., August 8 10, 2012 Unfolding Prismatoids as Convex Patches: Counterexamples and Positive Results Joseph O Rourke arxiv:1205.2048v1 [cs.cg] 9 May 2012 Abstract We address
More informationAnswer Key: Three-Dimensional Cross Sections
Geometry A Unit Answer Key: Three-Dimensional Cross Sections Name Date Objectives In this lesson, you will: visualize three-dimensional objects from different perspectives be able to create a projection
More informationLocal Mesh Operators: Extrusions Revisited
Local Mesh Operators: Extrusions Revisited Eric Landreneau Computer Science Department Abstract Vinod Srinivasan Visualization Sciences Program Texas A&M University Ergun Akleman Visualization Sciences
More informationWe have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.
Solid geometry We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. First, note that everything we have proven for the
More informationSymmetrohedra: Polyhedra from Symmetric Placement of Regular Polygons
Symmetrohedra: Polyhedra from Symmetric Placement of Regular Polygons Craig S. Kaplan University of Washington Box 352350, Seattle, WA 98195 USA csk@cs.washington.edu George W. Hart http://www.georgehart.com
More informationAbstract Construction Projects and the Imagination
Abstract Construction Projects and the Imagination Hands-on projects for understanding abstract mathematical concepts through the use of polyhedral models and planar designs The 3-dimensional projects
More informationPlatonic Solids and the Euler Characteristic
Platonic Solids and the Euler Characteristic Keith Jones Sanford Society, SUNY Oneonta September 2013 What is a Platonic Solid? A Platonic Solid is a 3-dimensional object with flat faces and straight edges
More informationExplore Solids
1212.1 Explore Solids Surface Area and Volume of Solids 12.2 Surface Area of Prisms and Cylinders 12.3 Surface Area of Pyramids and Cones 12.4 Volume of Prisms and Cylinders 12.5 Volume of Pyramids and
More informationRightStart G Learning Materials: Learning Goals/Performance Objectives: Learning Activities:
RightStart G Class Description: RightStartmath.com says "Learn intermediate mathematics hands-on and visually through geometry. With a tool set consisting of a drawing board, T-square, triangles, compass,
More informationCops and Robbers on Planar Graphs
Cops and Robbers on Planar Graphs Aaron Maurer (Carleton College) John McCauley (Haverford College) and Silviya Valeva (Mount Holyoke College) Summer 2010 Interdisciplinary Research Experience for Undergraduates
More informationEdge-transitive tessellations with non-negative Euler characteristic
October, 2009 p. Edge-transitive tessellations with non-negative Euler characteristic Alen Orbanić Daniel Pellicer Tomaž Pisanski Thomas Tucker Arjana Žitnik October, 2009 p. Maps 2-CELL EMBEDDING of a
More informationUnunfoldable polyhedra with convex faces
Computational Geometry 24 (2003) 51 62 www.elsevier.com/locate/comgeo Ununfoldable polyhedra with convex faces Marshall Bern a, Erik D. Demaine b,, David Eppstein c, Eric Kuo d,1, Andrea Mantler e,2, Jack
More informationUnfolding Rectangle-Faced Orthostacks
Unfolding Rectangle-Faced Orthostacks Erin W. Chambers Kyle A. Sykes Cynthia M. Traub Abstract We prove that rectangle-faced orthostacks, a restricted class of orthostacks, can be grid-edge unfolded without
More informationThe Zipper Foldings of the Diamond
The Zipper Foldings of the iamond rin W. hambers i Fang Kyle. ykes ynthia M. Traub Philip Trettenero bstract In this paper, we classify and compute the convex foldings of a particular rhombus that are
More informationFlavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville
Flavor of Computational Geometry Convex Hull in 2D Shireen Y. Elhabian Aly A. Farag University of Louisville February 2010 Agenda Introduction Definitions of Convexity and Convex Hulls Naïve Algorithms
More informationAraki, Yoshiaki; Horiyama, Takashi; Author(s) Ryuhei. Citation Lecture Notes in Computer Science, 8.
JAIST Reposi https://dspace.j Title Common Unfolding of Regular Johnson-Zalgaller Solid Tetrahed Araki, Yoshiaki; Horiyama, Takashi; Author(s) Ryuhei Citation Lecture Notes in Computer Science, 8 Issue
More informationJordan Curves. A curve is a subset of IR 2 of the form
Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0, 1]}, where γ : [0, 1] IR 2 is a continuous mapping from the closed interval [0, 1] to the plane. γ(0) and γ(1) are called the endpoints
More informationEuler Characteristic
Euler Characteristic Face Classification set_view(gl_render); set_scene(gl_render); glgetdoublev(gl_modelview_matrix, modelview_matrix1); glgetdoublev(gl_projection_matrix, projection_matrix1); glgetintegerv(gl_viewport,
More informationSTELLATION OF POLYHEDRA, AND COMPUTER IMPLEMENTATION
STELLATION OF POLYHEDRA, AND COMPUTER IMPLEMENTATION CHRISTOPHER J. HENRICH Abstract. The construction and display of graphic representations of stellated polyhedra requires a painstaking and close analysis
More informationMathematica Slovaca. Herbert Fleischner; Wilfried Imrich Transitive planar graphs. Terms of use: Persistent URL:
Mathematica Slovaca Herbert Fleischner; Wilfried Imrich Transitive planar graphs Mathematica Slovaca, Vol. 29 (1979), No. 2, 97--106 Persistent URL: http://dml.cz/dmlcz/131785 Terms of use: Mathematical
More informationWhen can a net fold to a polyhedron?
Computational Geometry 31 (2005) 207 218 www.elsevier.com/locate/comgeo When can a net fold to a polyhedron? Therese Biedl, Anna Lubiw, Julie Sun School of Computer Science, University of Waterloo, Waterloo,
More informationMa/CS 6b Class 9: Euler s Formula
Ma/CS 6b Class 9: Euler s Formula By Adam Sheffer Recall: Plane Graphs A plane graph is a drawing of a graph in the plane such that the edges are noncrossing curves. 1 Recall: Planar Graphs The drawing
More information,. ~ ~ Blending Polyhedra with Overlays. 1 Introduction. George W. Hart
BRIDGES Mathematical Connections in Art, Music~ and Science. Blending Polyhedra with Overlays Douglas Zongker University of Washington Box 352350 Seattle, WA 98195 dougz@cs.washington.edu George W. Hart
More informationINTRODUCTION TO GRAPH THEORY. 1. Definitions
INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with
More informationThe Topology of Bendless Orthogonal Three-Dimensional Graph Drawing. David Eppstein Computer Science Dept. Univ. of California, Irvine
The Topology of Bendless Orthogonal Three-Dimensional Graph Drawing David Eppstein Computer Science Dept. Univ. of California, Irvine Graph drawing: visual display of symbolic information Vertices and
More informationConvex Hulls in Three Dimensions. Polyhedra
Convex Hulls in Three Dimensions Polyhedra Polyhedron 1.A polyhedron is the generalization of a 2- D polygon to 3-D A finite number of flat polygonal faces The boundary or surface of a polyhedron - Zero-dimensional
More informationNO-NET POLYHEDRA Branko Grünbaum
Geombinatorics 11(2002), 111 114 NO-NET POLYHEDRA Branko Grünbaum Department of Mathematics, Box 354350 University of Washington, Seattle, WA 98195-4350 e-mail: grunbaum@math.washington.edu Dedicated with
More informationPart 1. Twice the number of edges = 2 9 = 18. Thus the Handshaking lemma... The sum of the vertex degrees = twice the number of edges holds.
MT6 Examination 16 Q1 (a) Part 1 Part1 Solutions (b) egree Sequence (,,,,, ) (c) Sum of the vertex degrees = + + + + + = 18 Twice the number of edges = 9 = 18. Thus the Handshaking lemma... The sum of
More informationGrade VIII. Mathematics Geometry Notes. #GrowWithGreen
Grade VIII Mathematics Geometry Notes #GrowWithGreen Polygons can be classified according to their number of sides (or vertices). The sum of all the interior angles of an n -sided polygon is given by,
More informationLESSON. Bigger and Bigger. Years 5 to 9. Enlarging Figures to Construct Polyhedra Nets
LESSON 4 Bigger and Bigger Years 5 to 9 Enlarging Figures to Construct Polyhedra Nets This lesson involves students using their MATHOMAT to enlarge regular polygons to produce nets of selected polyhedra,
More informationUniform Polyhedra. Roman E. Maeder. Published in The Mathematica Journal, 3(4), 1993.
Uniform Polyhedra Roman E. Maeder Published in The Mathematica Journal, 3(4), 1993. Uniform polyhedra consist of regular faces and congruent vertices. Allowing for nonconvex faces and vertex figures, there
More informationVertex-Transitive Polyhedra of Higher Genus, I
Vertex-Transitive Polyhedra of Higher Genus, I Undine Leopold arxiv:1502.07497v1 [math.mg] 26 Feb 2015 Since Grünbaum and Shephard s investigation of self-intersection-free polyhedra with positive genus
More informationUnfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results
CCCG 2013, Waterloo, Ontario, August 8 10, 2013 Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results Joseph O Rourke Abstract We address unsolved problems of unfolding polyhedra
More informationEuclid forgot to require that the vertices should be the same, so his definition includes the deltahedra.
2 1. What is a Platonic solid? What is a deltahedron? Give at least one example of a deltahedron that is t a Platonic solid. What is the error Euclid made when he defined a Platonic solid? Solution: A
More informationarxiv: v1 [cs.cg] 2 Jul 2016
Reversible Nets of Polyhedra Jin Akiyama 1, Stefan Langerman 2, and Kiyoko Matsunaga 1 arxiv:1607.00538v1 [cs.cg] 2 Jul 2016 1 Tokyo University of Science, 1-3 Kagurazaka, Shinjuku, Tokyo 162-8601, Japan
More informationCovering Polyhedra by Motifs with Triangular Fundamental Regions. A Thesis. submitted to the faculty of the Graduate School
Covering Polyhedra by Motifs with Triangular Fundamental Regions A Thesis submitted to the faculty of the Graduate School of University of Minnesota by Lakshmi Ramya Pathi In partial fulfillment of the
More informationThe Volume of a Platonic Solid
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-007 The Volume of a Platonic Solid Cindy Steinkruger
More informationWeek 9: Planar and non-planar graphs. 7 and 9 November, 2018
(1/27) MA284 : Discrete Mathematics Week 9: Planar and non-planar graphs http://www.maths.nuigalway.ie/ niall/ma284/ 7 and 9 November, 2018 1 Planar graphs and Euler s formula 2 Non-planar graphs K 5 K
More informationNon-extendible finite polycycles
Izvestiya: Mathematics 70:3 1 18 Izvestiya RAN : Ser. Mat. 70:3 3 22 c 2006 RAS(DoM) and LMS DOI 10.1070/IM2006v170n01ABEH002301 Non-extendible finite polycycles M. Deza, S. V. Shpectorov, M. I. Shtogrin
More informationSection 9.4. Volume and Surface Area. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 9.4 Volume and Surface Area What You Will Learn Volume Surface Area 9.4-2 Volume Volume is the measure of the capacity of a three-dimensional figure. It is the amount of material you can put inside
More informationPolyhedral Transformation: Explosion-Implosion
Polyhedral Transformation: Explosion-Implosion Robert McDermott Center for High Performance Computing University of Utah Salt Lake City, Utah 84112, USA Email: mcdermott@chpc.utah.edu Abstract Polyhedral
More informationUnfolding Polyhedra. Joseph O Rourke. July 10, 2008
Unfolding Polyhedra Joseph O Rourke July 10, 2008 Contents 1 Introduction 1 2 Edge Unfolding 1 2.1 Nonconvex: Not Always Possible.................. 1 2.2 Convex: Open............................. 3 Prismoids............................
More informationGeometric Modeling Mortenson Chapter 11. Complex Model Construction
Geometric Modeling 91.580.201 Mortenson Chapter 11 Complex Model Construction Topics Topology of Models Connectivity and other intrinsic properties Graph-Based Models Emphasize topological structure Boolean
More information1 The Platonic Solids
1 The We take the celebration of Dodecahedron Day as an opportunity embark on a discussion of perhaps the best-known and most celebrated of all polyhedra the Platonic solids. Before doing so, however,
More informationLie Theory Through Examples. John Baez. Lecture 2
Lie Theory Through Examples John Baez Lecture 2 1 A 3 Now let s draw the A 3 lattice. To do this, we must start with some general theory. You see, last time we just guessed that the best way to draw the
More informationDominating Sets in Triangulations on Surfaces
Dominating Sets in Triangulations on Surfaces Hong Liu Department of Mathematics University of Illinois This is a joint work with Michael Pelsmajer May 14, 2011 Introduction A dominating set D V of a graph
More informationEquipartite polytopes and graphs
Equipartite polytopes and graphs Branko Grünbaum Tomáš Kaiser Daniel Král Moshe Rosenfeld Abstract A graph G of even order is weakly equipartite if for any partition of its vertex set into subsets V 1
More informationThe Game of Criss-Cross
Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that
More informationEquiprojective Polyhedra
Equiprojective Polyhedra Masud Hasan Anna Lubiw University of Waterloo Equiprojective Polyhedra convex polyhedron orthographic projection = shadow size of shadow boundary equiprojective = constant size
More informationEquipartite polytopes and graphs
Equipartite polytopes and graphs Branko Grünbaum Tomáš Kaiser Daniel Král Moshe Rosenfeld Abstract A graph G of even order is weakly equipartite if for any partition of its vertex set into subsets V 1
More informationTriangulations of hyperbolic 3-manifolds admitting strict angle structures
Triangulations of hyperbolic 3-manifolds admitting strict angle structures Craig D. Hodgson, J. Hyam Rubinstein and Henry Segerman segerman@unimelb.edu.au University of Melbourne January 4 th 2012 Ideal
More informationPolygons and Convexity
Geometry Week 4 Sec 2.5 to ch. 2 test Polygons and Convexity section 2.5 convex set has the property that any two of its points determine a segment contained in the set concave set a set that is not convex
More informationMinimum Perimeter Developments of the Platonic Solids
Thai Journal of Mathematics Volume 9 (2011) Number 3 : 461 487 www.math.science.cmu.ac.th/thaijournal Online ISSN 1686-0209 Minimum Perimeter Developments of the Platonic Solids Jin Akiyama,1, Xin Chen,
More informationReversible Nets of Polyhedra
Reversible Nets of Polyhedra Jin Akiyama 1, Stefan Langerman 2(B), and Kiyoko Matsunaga 1 1 Tokyo University of Science, 1-3 Kagurazaka, Shinjuku, Tokyo 162-8601, Japan ja@jin-akiyama.com, matsunaga@mathlab-jp.com
More informationRegular Polyhedra of Index Two, I
Regular Polyhedra of Index Two, I Anthony M. Cutler Northeastern University Boston, MA 02115, USA arxiv:1005.4911v1 [math.mg] 26 May 2010 and Egon Schulte Northeastern University Boston, MA 02115, USA
More informationA Developable Surface of Uniformly Negative Internal Angle Deficit
A Developable Surface of Uniformly Negative Internal Angle Deficit Phillips A Benton Centre for Mathematical Sciences, Cambridge CB3 0WA, United Kingdom A.Benton@damtp.cam.ac.uk Abstract. The author addresses
More information