Local Overlaps in Unfoldings of Polyhedra Brendan LucierAnna Lubiw University of Waterloo Presented at the 15th Annual Fall Workshop on Computational Geometry,

Slides:



Advertisements
Similar presentations
Part III: Polyhedra b: Unfolding
Advertisements

Convex drawing chapter 5 Ingeborg Groeneweg. Summery What is convex drawing What is convex drawing Some definitions Some definitions Testing convexity.
Open Problem 9 Yoosun Song CSCE 620 : EDGE-UNFOLDING CONVEX POLYHEDRA Yoosun Song.
Informationsteknologi Wednesday, November 7, 2007Computer Graphics - Class 51 Today’s class Geometric objects and transformations.
Honors Geometry Sections 6.3 & 7.2 Surface Area and Volume of Prisms
CS447/ Realistic Rendering -- Solids Modeling -- Introduction to 2D and 3D Computer Graphics.
3. Delaunay triangulation
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
Curve Curve: The image of a continous map from [0,1] to R 2. Polygonal curve: A curve composed of finitely many line segments. Polygonal u,v-curve: A polygonal.
Introduction A line of symmetry,, is a line separating a figure into two halves that are mirror images. Line symmetry exists for a figure if for every.
Geometry Chapter 20. Geometry is the study of shapes Geometry is a way of thinking about and seeing the world. Geometry is evident in nature, art and.
VOCABULARY GEOMETRIC FIGURES. POLYGON Is a closed plane figure formed by three or more line segments that meet at points called vertices.
9-4 Geometry in Three Dimensions  Simple Closed Surfaces  Regular Polyhedra  Cylinders and Cones.
Subdivision of Edge In a graph G, subdivision of an edge uv is the operation of replacing uv with a path u,w,v through a new vertex w.
Unit 9 Understanding 3D Figures
12.2 Nets and Surface Area.
Surface Area of Prisms SECTION After completing this lesson, you will be able to say: I can represent three-dimensional figures using nets made.
Vertex – A point at which two or more edges meet Edge – A line segment at which two faces intersect Face – A flat surface Vertices, Edges, Faces.
Part 6: Graphics Output Primitives (4) 1.  Another useful construct,besides points, straight line segments, and curves for describing components of a.
An Improved Degree Based Condition for Hamiltonian Cycles November 22, 2005 November 22, 2005.
12. Polyhedra
Nonoverlap of the Star Unfolding Boris Aronov and Joseph O’Rourke, 1991 A Summary by Brendan Lucier, 2004.
Form 1 Mathematics Chapter 6.  SHW (III), Re-dictation & OBQ  Today  SHW (I), Dictation, Re-dictation Correction  1 Feb (Fri)  SHW (II), (III), Drawing,
A. Polyhedrons 1. Vocabulary of Polyhedrons 2. Building Polyhedrons a. Create a net from the Polyhedron b. Create the Polyhedron from the net B. Prisms.
Computer Graphics Basic 3D Geometry CO2409 Computer Graphics Week 5-1.
Slope and Parallel Lines Sections 4.5 & 4.6. Definitions A plane is a surface such that if any two points on the surface are connected by a line, all.
Plane Mirror: a mirror with a flat surface
6.1 - Solid Shapes & Spatial Relationships
Chapter Area, Pythagorean Theorem, and Volume 14 Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
Geometry Bingo. A parallelogram with four right angles. Opposite sides are parallel and congruent.
1 11. Polygons Polygons 2D polygons ( 다각형 ) –Polygon sides are all straight lines lying in the same plane 3D polyhedra ( 다면체 )  chap. 12 –Polyhedra.
Unfolding and Reconstructing Polyhedra
Geometry Vocabulary. Triangle Triangle: a polygon with three sides. 180⁰ Sum of the interior angles of a triangle = 180⁰.
Chapter 11: Surface Area & Volume
Chapter 10 Measurement Section 10.5 Surface Area.
6.1 - Solid Shapes & Spatial Relationships.
11-1 Space Figures and Cross Sections Objectives To recognize polyhedra and their parts To visualize cross sections of space figures.
Unfolding and Reconstructing Polyhedra Brendan Lucier University of Waterloo Master’s Thesis Presentation University of Waterloo, Waterloo, Ontario January.
Vocabulary Word: Supplementary Angles Definition: Two angles whose sum is 180°.
Nets & Drawings for Visualizing Geometry Section 1-1.
Polygons A polygon is a plane shape with straight sides.
Section 10.1 Points, Lines, Planes, and Angles Math in Our World.
GEOMETRY UNIT 3 VOCABULARY ALL ABOUT ANGLES. ANGLE DEFINITION Angle A figure formed by two rays with a common endpoint.
2D & 3D Geometric Shapes Characteristics&Properties.
Copyright © Cengage Learning. All rights reserved. Parallel Lines 2 2 Chapter.
12.2 Surface Area of Prisms & Cylinders Geometry.
Solid Shapes. The basics ♥Polygon – 2 space ♥Polyhedron = 3 space ♥Polyhedra or Polyhedrons = plural ♥ A Polyhedron is a closed figure, made up of polygons.
12.1 Exploring Solids Hubarth Geometry. The three-dimensional shapes on this page are examples of solid figures, or solids. When a solid is formed by.
Angles Quiz.
Developing Geometric Thinking and Spatial Sense
9-1 Introduction to Three-Dimensional Figures Warm Up
Plane figure with segments for sides
REVIEW OF LAST WEEK.
Introduction to Geometry
Introduction A chef takes a knife and slices a carrot in half. What shape results? Depending on the direction of the cut, the resulting shape may resemble.
Basic Vocabulary Student Friendly: I will be able to define an angle, circle, perpendicular lines, parallel lines, and line segments using the definition.
INTRODUCTION TO GEOMETRIC SOLIDS.
10-1: Introduction to Solids
Symmetry and three-dimensional geometry
9-1 Introduction to Three-Dimensional Figures Warm Up
Introduction A line of symmetry, , is a line separating a figure into two halves that are mirror images. Line symmetry exists for a figure if for every.
4.5 Introduction To Parallel Lines
Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.
Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.
Introduction to Geometry
Vertical Angles Vertical angles are across from each other and are created by intersecting lines.
14 Chapter Area, Pythagorean Theorem, and Volume
Presentation transcript:

Local Overlaps in Unfoldings of Polyhedra Brendan LucierAnna Lubiw University of Waterloo Presented at the 15th Annual Fall Workshop on Computational Geometry, 2005 University of Pennsylvania, Philadelphia, PA

Local Overlaps in Unfoldings of Polyhedra Brendan LucierAnna Lubiw University of Waterloo Presented at the 15th Annual Fall Workshop on Computational Geometry, 2005 University of Pennsylvania, Philadelphia, PA

Outline Introduction Avoidability of 1-Local Overlaps Small Ununfoldable Polyhedron

Outline Introduction Avoidability of 1-Local Overlaps Small Ununfoldable Polyhedron

Unfolding Polyhedra We consider the act of cutting a polyhedron along its edges and unfolding it into the plane. The resulting planar figure is an edge unfolding. Two faces of the unfolding overlap if they have a common interior point. An unfolding with no overlap is a simple unfolding, or net. A polyhedron with no net is referred to as ununfoldable.

Locality of Overlaps One problem in studying overlaps is that two faces in vastly different parts of a polyhedron could intersect in an unfolding. We propose a definition of locality of an overlap. An overlap is k-local if the overlapping faces are connected by a path of k vertices. In particular, an overlap is 1-local if the overlapping faces are coincident with a vertex in the unfolding. 2-local overlap 1-local overlap

Outline Introduction Avoidability of 1-Local Overlaps Small Ununfoldable Polyhedron

Describing 1-Local Overlaps A 1-local overlap corresponds precisely to a situation in which a vertex in an unfolding has total face angle greater than 2π. To create such an overlap, we must start with a vertex in the polyhedron with negative curvature, then cut in such a way that one image of the vertex will retain at least 2π of the surface material. Convex polyhedra clearly avoid 1-local overlaps, since they contain no vertices with negative curvature. Motivating Question: does every polyhedron admit an unfolding that contains no 1-local overlaps? No!

Four-Pointed Star Our polyhedron is a 4-pointed star. The polyhedron is parameterized:  α is the length of each spike.  β is the height of the center points. The parameter values are not important, aside from considering alpha to be sufficiently large and beta sufficiently small.

Argument Claim: every unfolding of the four- pointed star contains a 1-local overlap. Each of the four B vertices has four face angles, each larger than 2π/3. If three of these faces appeared in one component of an unfolding, we have a 1-local overlap To prevent this, we must cut at least two opposing edges incident to each B vertex.

Argument (con’t) Our cuts cannot make a cycle, otherwise we get a disconnected unfolding. So no two pairs of opposing cuts can be made to the middle vertices. Also, not all pairs can be made to the points of the star. The cuts must therefore be made as shown in the bottom diagram. There is only one more cut that can be made, since the set of all cuts must make a spanning tree over all vertices.

Argument (con’t) Note that the center vertices have negative curvature (they form saddles). Each must have at least 2 incident cuts, otherwise all the face angles will go to one component and form a 1-local overlap. However, our remaining cut cannot be incident with both center vertices, since they are not adjacent. It is therefore impossible to cut our 4-pointed star to avoid 1-local overlaps.

Outline Introduction (Un)avoidability of 1-Local Overlaps A Small Ununfoldable Polyhedron

Creating a Smaller Example The 4-Pointed Star is an ununfoldable polyhedron with 16 triangular faces. We shall now make modifications to create a smaller polyhedron.  This polyhedron will remain ununfoldable, but will avoid 1-local overlaps. The result will be a starlike ununfoldable polyhedron with 9 faces.

Modification #1: 3-Pointed Star

Modification #2: Flatten One side of the polyhedron is flattened. Two triangular faces are combined into a single quadrilateral face. Think of the operation as “cutting” the polyhedron into two halves, lengthwise. This introduces the degeneracy of coplanar faces, but this can be fixed by sufficiently small perturbation.

Modification #3: Asymmetricize Perturb the symmetry of the points by increasing the angle between two points. This adds a new parameter, φ, indicating the angle change. We do this to increase the face angles at two of the B vertices to larger than 2π/3. Perturbing by φ = 10 o is sufficient.

Unfolding This Polyhedron At the B vertices with face angles greater than 2π/3, two opposing edges must be cut. Two cuts must be incident with the top center vertex, as it has negative curvature. The remaining B vertex also has negative curvature, so must have two incident cuts. This leaves a few possibilities for unfolding, which are dealt with by a case analysis.

Possible Unfoldings

Summary We study local overlaps in an attempt to simplify analysis of unfoldings and characterize the types of overlaps that can occur in unfoldings. There is a starlike polyhedron with 16 triangular faces for which every unfolding contains a 1- local overlap. There exists an ununfoldable, starlike, convex- faced polyhedron with 9 faces.