Joining Unfoldings of 3-D Surfaces

Slides:



Advertisements
Similar presentations
Part III: Polyhedra a: Folding Polygons
Advertisements

1 st Meeting, Industrial Geometry, 2005 Approximating Solids by Balls (in collaboration with subproject: "Applications of Higher Geometrics") Bernhard.
Open Problem 9 Yoosun Song CSCE 620 : EDGE-UNFOLDING CONVEX POLYHEDRA Yoosun Song.
Surface Reconstruction From Unorganized Point Sets
Proximity graphs: reconstruction of curves and surfaces
Computing Convex Hulls CLRS 33.3
I. The Problem of Molding Does a given object have a mold from which it can be removed? object not removable mold 1 object removable Assumptions The object.
Convex Hulls in Two Dimensions Definitions Basic algorithms Gift Wrapping (algorithm of Jarvis ) Graham scan Divide and conquer Convex Hull for line intersections.
Computational Geometry
Informationsteknologi Wednesday, November 7, 2007Computer Graphics - Class 51 Today’s class Geometric objects and transformations.
Auxiliary Views.
17. Computational Geometry Chapter 7 Voronoi Diagrams.
2. Voronoi Diagram 2.1 Definiton Given a finite set S of points in the plane , each point X of  defines a subset S X of S consisting of the points of.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Lecture 3 Chapter 3: 2D Convex Hulls Friday,
Half-Space Intersections
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Chapter 5: Voronoi Diagrams Monday, 2/23/04.
1 Jinxiang Chai CSCE 441 Computer Graphics. 2 Midterm Time: 10:10pm-11:20pm, 10/20 Location: HRBB 113.
Point Location Computational Geometry, WS 2007/08 Lecture 5 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät für.
Lecture 6: Point Location Computational Geometry Prof. Dr. Th. Ottmann 1 Point Location 1.Trapezoidal decomposition. 2.A search structure. 3.Randomized,
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Lecture 2 Chapter 2: Polygon Partitioning.
3D Model Objects. Wireframes A wireframe model is a skeletal description of a 3D object. There are no surfaces in a wireframe model; it consists only.
1st Meeting Industrial Geometry Approximation Theory and Computational Geometry 1st IG-Meeting New Allies Joint research with project S09202 "Coupling.
Globally Optimal Grouping for Symmetric Closed Boundaries with Stahl/ Wang Method Vida Movahedi September 2007.
Lecture 5. Morphological Image Processing. 10/6/20152 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of animals.
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.
Line Arrangement Chapter 6. Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision.
Quadratic Surfaces. SPLINE REPRESENTATIONS a spline is a flexible strip used to produce a smooth curve through a designated set of points. We.
Digital Image Processing Chapter 9: Morphological Image Processing 5 September 2007 Digital Image Processing Chapter 9: Morphological Image Processing.
1 Shortest Paths in Three Dimensions Speaker: Atlas F. Cook IV Advisor: Carola Wenk.
Nonoverlap of the Star Unfolding Boris Aronov and Joseph O’Rourke, 1991 A Summary by Brendan Lucier, 2004.
UNIT 9.  Geometrical volumes, like the one you can see on this page (in this picture), can be easily reproduced in real sizes by precise drawings. 
Approximate Convex Decomposition of Polygons Reporter: Hong guang Zhou Math Dept. ZJU May 17th, 2007 Jyh-Ming Lien Nancy M. Amato Computational Geometry:
On Graphs Supporting Greedy Forwarding for Directional Wireless Networks W. Si, B. Scholz, G. Mao, R. Boreli, et al. University of Western Sydney National.
CMPS 3120: Computational Geometry Spring 2013
Geometric Modeling How to design a graphical model? How to create a digital description of a real-world object? Design Digitize.
A New Voronoi-based Reconstruction Algorithm
Chapter Area, Pythagorean Theorem, and Volume 14 Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
Local Overlaps in Unfoldings of Polyhedra Brendan LucierAnna Lubiw University of Waterloo Presented at the 15th Annual Fall Workshop on Computational Geometry,
Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China.
Constructive Solid Geometry Ray Tracing CSG Models
Homework - hints Problem 1. Node weights  Edge weights
COMPUTATIONAL GEOMETRY AND MATRIX MULTIPLICATION Mohammed Zeeshan Farooqui Minhaj Uddin.
CS6234 Advanced Algorithms - Convex hull. Terminologies – ◦ Convex hull of a set Q of points is the smallest convex polygon P for which each point in.
1 Sheet Metal Design (III) Hong RuJin September, 10, 2000.
Computer – Aided Design Terminology You must have a generic understanding of commands and techniques which are used in a number of packages (YOU CANNOT.
Computer – Aided Design Terminology You must have a generic understanding of commands and techniques which are used in a number of packages (YOU CANNOT.
Computational Geometry
Bridge Extraction based on Constrained Delaunay Triangulation Feng Gao Lei Hu Zhaofeng He.
Compositions of Transformations. Review Name the Transformation Original Image Translation.
Sit at tables Take notes on how to construct a Tetrahedron Kite.
Date of download: 11/12/2016 Copyright © ASME. All rights reserved. From: Edge-Compositions of 3D Surfaces J. Mech. Des. 2013;135(11):
Lecture 5 Basic geometric objects
The Minimum Perimeter Convex Hull of a Given Set of Disjoint Segments
REPRESENTATION OF SPACE
Physical Structure of GDB
Introduction to Polygons
Spatial Analysis and Functions
Spatial Data Processing
Three-dimensional figures, or solids, can be made up of flat or curved surfaces. Each flat surface is called a face. An edge is the segment that is the.
GRAPH SPANNERS.
PMC and Booleans Point-Membership Classification
I. The Problem of Molding
Computing the Visibility Polygon of an Island in a Polygonal Domain
LCTS: Ray Shooting using Longest Common Traversal Sequences
Computational Geometry
Iso-Surface extraction from red and green samples on a regular lattice
Overlay of Two Subdivisions
Computational Geometry Algorithms
Type to enter a caption. Computer Graphics Week 5 Lecture 1.
Computational Geometry
Presentation transcript:

Joining Unfoldings of 3-D Surfaces IDETC/CIE 2013 Joining Unfoldings of 3-D Surfaces Cynthia Sung, Erik D. Demaine, Martin L. Demaine, Daniela Rus September 23, 2013 15 min

Related Work in Unfolding Computational Geometry Polyhedron unfolding (Schlichenrieder 1997, Demaine et al. 2002, Bern 2003, Lucier 2006) Unfolding by composition (Mitani 2011, Cheng & Cheong 2012) Sheet Metal Design Automated design (Wang 1997, Bush & Sèquin 1999, Patel & Campbell 2010) DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Our Contribution An algorithm that computes a one-piece non-self-intersecting edge-composition of two folded surfaces. DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Edge-Composition Problem Given: Two unfoldings and an edge on each + DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Edge-Composition Problem Given: Two unfoldings and an edge on each Find: An unfolding of the combined surface, where the two originals meet at the given edges More technical description in paper +  DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are on the boundaries of the convex hulls of the unfoldings, then place the edges coincident. DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are on the boundaries of the convex hulls of the unfoldings, then place the edges coincident. DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are on the boundaries of the convex hulls of the unfoldings, then place the edges coincident. DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are not on the boundaries of the convex hulls of the unfoldings, then construct a bridge. Add real unfoldings here DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are not on the boundaries of the convex hulls of the unfoldings, then construct a bridge. Add real unfoldings here DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are not on the boundaries of the convex hulls of the unfoldings, then construct a bridge. Add real unfoldings here DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are not on the boundaries of the convex hulls of the unfoldings, then construct a bridge. Add real unfoldings here DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are not on the boundaries of the convex hulls of the unfoldings, then construct a bridge. Add real unfoldings here DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are not on the boundaries of the convex hulls of the unfoldings, then construct a bridge. Add real unfoldings here DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are not on the boundaries of the convex hulls of the unfoldings, then construct a bridge. Add real unfoldings here DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Main Insight If the edges to join are not on the boundaries of the convex hulls of the unfoldings, then construct a bridge. Add real unfoldings here DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 1: Edges on the Boundary Input: unfolding, edge edge to join convex hull boundary DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 1: Edges on the Boundary Input: unfolding, edge Compute medial axis medial axis DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 1: Edges on the Boundary Input: unfolding, edge Compute medial axis Find path to the boundary of the convex hull path DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 1: Edges on the Boundary Input: unfolding, edge Compute medial axis Find path to the boundary of the convex hull Overlay pleats Remove intersections pleats DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 1: Edges on the Boundary Input: unfolding, edge Compute medial axis Find path to the boundary of the convex hull Overlay pleats Remove intersections Output: bridged unfolding DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Pleat Construction DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 2: Edges on the Interior Input: unfolding, edge edge to join convex hull boundary DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 2: Edges on the Interior Input: unfolding, edge Find path to the boundary path DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 2: Edges on the Interior Input: unfolding, edge Find path to the boundary Bridge to the boundary of the convex hull initial bridge DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 2: Edges on the Interior Input: unfolding, edge Find path to the boundary Bridge to the boundary of the convex hull Reflect traversed faces reflected faces DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 2: Edges on the Interior Input: unfolding, edge Find path to the boundary Bridge to the boundary of the convex hull Reflect traversed faces added bridge DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Constructing a Bridge Case 2: Edges on the Interior Input: unfolding, edge Find path to the boundary Bridge to the boundary of the convex hull Reflect traversed faces Output: bridged unfolding DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Overlaps with the Unfolding DETC2013-12692 Joining Unfoldings of 3-D Surfaces

 Example Compositions DETC2013-12692 Joining Unfoldings of 3-D Surfaces

 Example Compositions DETC2013-12692 Joining Unfoldings of 3-D Surfaces

Current Work DETC2013-12692 Joining Unfoldings of 3-D Surfaces