Layered Manufacturing of Thin-Walled Parts Sara McMains, Jordan Smith, Jianlin Wang, Carlo Séquin UC Berkeley.

Slides:



Advertisements
Similar presentations
Jane Yen Carlo Séquin UC Berkeley I3D 2001 [1] M.C. Escher, His Life and Complete Graphic Work Escher Sphere Construction Kit.
Advertisements

C4 – Rapid Prototype Manufacture
Advanced Manufacturing Laboratory Department of Industrial Engineering Sharif University of Technology Session # 8.
Volumes. Polyhedrons What is a polyhedron? Circles are not polygons.
Closest Point Transform: The Characteristics/Scan Conversion Algorithm Sean Mauch Caltech April, 2003.
Fast and Extensible Building Modeling from Airborne LiDAR Data Qian-Yi Zhou Ulrich Neumann University of Southern California.
RAPID PROTOTYPING Fundamentals of Rapid Prototyping
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
ENGINEERING SURVEYING & PHOTOGRAMMETRY CVE 314
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 9 3D Modeling.
17. Computational Geometry Chapter 7 Voronoi Diagrams.
Computing 3D Geometry Directly From Range Images Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
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.
IE 590 J Cecil NMSU 1 IE 590 Integrated Manufacturing Systems Lecture 4 CAD & Geometric Modeling.
CS 128/ES Lecture 12b1 Spatial Analysis (3D)
11-1 Space Figures and Cross Sections
Representation Issues in Data Exchange for RP-LM Sara McMains U.C. Berkeley.
IE433 CAD/CAM Computer Aided Design and Computer Aided Manufacturing Part-4 Computer Graphics- CAD Software Industrial Engineering Program King Saud University.
Research Goal  We provide physical visualizations to modern structural biologists, thus reviving tactile feedback, in addition to immersive environments.
Rapid prototyping is a computer program that constructs three-dimensional models of work derived from a Computer Aided Design (CAD) drawing. With the use.
Communications Systems EDU-2460 Topic: Computer Aided Design (Chapter 2) By Leetyler Edwyn Dailey.
Computer-Aided Design and Manufacturing Laboratory: Research Overview Sara McMains UC Berkeley.
Section 1: Earth: A Unique Planet
Introduction Tracking the corners Camera model and collision detection Keyframes Path Correction Controlling the entire path of a virtual camera In computer.
Computer-Aided Design and Manufacturing Laboratory: Rotational Drainability Sara McMains UC Berkeley.
COMPUTER AIDED DESIGN -(CAD)-3
Computer-Aided Design and Manufacturing Laboratory: 3D Minkowski sum computation Sara McMains UC Berkeley.
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.
SELECTIVE LASER SINTERING
Schloss Dagstuhl, September 2014 Shape Representation Carlo H. Séquin University of California, Berkeley Slicing Less than Perfect B-Reps and the Winding-Number.
An Application of Tetrahedrisation to From-Point Visibility Honours Project Proposal Gerard Ryan and Brendon Miszka
11.3 Surface Areas of Pyramids and Cones A pyramid is a polyhedron in which one face (the base) can be any polygon and the other faces (the lateral faces)
Geometry B Section 12.3 Surface Area of Pyramids and Cones.
ME6104: CAD. Module 32. ME6104: CAD. Module 32. Systems Realization Laboratory Module 32 CAD-RP Transition ME 6104.
© Pearson & GNU Su-Jin Kim Plastics Manufacturing Processes Rapid prototyping 3d CAD  Real part.
1 Shortest Paths in Three Dimensions Speaker: Atlas F. Cook IV Advisor: Carola Wenk.
Copyright © 2010 Altair Engineering, Inc. All rights reserved.Altair Proprietary and Confidential Information Section 4 Applications.
UNIT THREE REVIEW Geometry 217. True/False  A translation is an arrangement of shapes that covers a plane completely without gaps or overlaps.
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.
Adaptive Meshing Control to Improve Petascale Compass Simulations Xiao-Juan Luo and Mark S Shephard Scientific Computation Research Center (SCOREC) Interoperable.
Spatial Analyst - Cost Distance Analysis Kevin M. Johnston.
Chapter Area, Pythagorean Theorem, and Volume 14 Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
ENGR-22_Lec-28_SolidModel-1.ppt 1 Bruce Mayer, PE Engineering 22 – Engineering Design Graphics Bruce Mayer, PE Licensed Electrical.
Geometrically Bounded Wireframe AIC (Part 510) Grouping of curves relevant for 3-dimensional wireframe modeling without topological constructs Elementary.
Continuing Study of the Modeling “Add-ins” IE 1225 – Introduction to Design and Manufacturing R. Lindeke & J. Voss.
Simulation and Experimental Verification of Model Based Opto-Electronic Automation Drexel University Department of Electrical and Computer Engineering.
Section 7.3 Volume: The Shell Method. When finding volumes of solids by the disk (or washer) method we were routinely imagining our ‘slices’ under the.
Chapter 11: Surface Area & Volume
Solid Modeling Prof. Lizhuang Ma Shanghai Jiao Tong University.
polyhedron a three- dimensional figure whose surfaces are polygons faces edge vertex.
11-1 Space Figures and Cross Sections Objectives To recognize polyhedra and their parts To visualize cross sections of space figures.
GEOMETRY CHAPTER 11 SUMMARY. Three-dimensional figures, or solids, can be made up of flat or curved surfaces. Each flat surface is called a face. An edge.
Geometry 2007 Released Test. 1. Transversal l cuts lines a, b, c, and d. Which two lines are parallel?
Volume of Prisms and Cylinders Section 9.4. Objectives: Find the volume of prisms and cylinders.
( a and K are unknown ) Real System Model Sensitivity Equations + - Required for Feed Forward Model. Numerical Power models typically are non-invertible.
Basics of 3D Printing.
Basics of 3D Printing.
3D Modeling Basics Three basic types of 3D CAD models:
An-Najah National University – Nablus Faculty of Engineering
Copyright © Cengage Learning. All rights reserved.
11.3 Surface Areas of Pyramids and Cones
Craig Schroeder October 26, 2004
6.2 Volume: The Disc Method
14 Chapter Area, Pythagorean Theorem, and Volume
A polygon is a plane figure with three or more than three segments.
Rapid Manufacturing for Research
Volume and Surface Area
Prof. Lizhuang Ma Shanghai Jiao Tong University
Presentation transcript:

Layered Manufacturing of Thin-Walled Parts Sara McMains, Jordan Smith, Jianlin Wang, Carlo Séquin UC Berkeley

Is Layered Manufacturing really Rapid Prototyping? How can we speed up these manufacturing technologies? 3.5”, 20hrs3.0”, 25 hrs2.5”, 15hrs

Raster Scan Technologies Example: 3D Printing Speed of roller limits the process Build time = z-height Speed up: pack build volume in xy with many parts

Vector Scan Technologies Example: FDM (Fused Deposition Modeling) Build time = volume scanned (material used) Our Goal: create a sturdy part that is visually equivalent but uses less material, so that it builds faster

Building Solid Parts with QuickSlice Software interface to Stratasys 1650 FDM Machine Input: STL boundary representation Slices model into z-layer contours (SSL) Builds support structure Builds roads (nozzle fill path) (SML) FDM Roads SML 3D B-Rep STL SupportSlicer QuickSlice SSL

QuickSlice Fast Build Builds a semi-hollow version of the solid n solid offset rings Center filled with a loose crosshatch pattern FDM Roads SML 3D B-Rep STL SupportSlicer QuickSlice SSL Fast

Fast Build Limitations Structurally conservative Only applied to slice layers whose center area is completely covered by slices above and below it Gradually sloping surfaces prevent its application Worst case example z

Can Approach Be More Aggressive? Our Goal: –Create an automated process –Input: the boundary representation of a desired solid geometry –Output: a sturdy, physical part that is visually equivalent while using less material –Benefits: faster build times and material conservation Our Assets: –QuickSlice software as a black box –Specifically the loose fill crosshatched roads option SML 3D B-Rep FDM Automated Process?

Idea #1: 3D Offset Pipeline Solid-fill the volume between the input and the offset surfaces Crosshatch-fill the volume within the offset surface Polyhedron Offset FDM Quick Slice SML 3D B-Rep STL Unfortunately, the 3D offset is Assume we have true 3D offset surface at the desired distance inward Difficult to implement robustly Too aggressive: slicing can produce gaps near gradually sloping walls z

Idea #2: Approximate 3D Offset Key ideas: –Offsetting is much simpler in 2D than in 3D –The manufacturing process eventually represents the part as a stack in z of layers of 2D contours Start: slice polyhedron into desired set of 2D contours End: input SSL to QuickSlice to build support and roads SML Slices 3D B-Rep Slicer FDM RoadsSupportSlicer QuickSlice SSL

2D Contour Offset Data: layers of 2D contours Offset the 2D contours inward by a specified distance = n layer thicknesses Near vertical walls, this is the correct 3D offset Approximation degrades as the walls approach horizontal Slices 3D B-Rep Offsets Slicer Contour Offset SML SSL FDM RSS QuickSlice

2½D Polyhedron Offset Data: layers of 2D contours and offsets Adjust the loose fill areas in regions where the vertical coverage above or below is less than n layers thick –Perform 2D boolean (CSG) combinations of the contours and offsets of the ith layer with the n layers above and below it –We use OpenGL for the 2D booleans SML SSL Slices 3D B-Rep Offsets 2½D CSG Slicer FDM Contour Offset RSS QuickSlice

Regularized Boolean Operations Unregularized: op  { , , - } Regularized: op*  {  *,  *, -* } A op* B = Closure( Interior( A op B ) ) If A & B are 2D areas and C = A op* B then C is a non-degenerate 2D area or  B A  * B A A  B

1-Layer Thick 2½D Offset z

z

z

n-Layer Thick 2½D Offset z

z

z

Results: the Bolt Part QuickSlice Fast Build –Time: 504 min (8:24) –Filament used: 22.1 m 2½D Offset Method –Time: 232 min (3:52) –Filament used: 7.6 m QuickSlice took 2.71 times as long and used 2.9 times as much filament

Conclusion We have implemented a robust 2D contour offsetting program. We have conservatively approximated the 3D polyhedron offset using 2D contour slices, 2D offsets, and 2½D boolean operations. We have demonstrated a novel approach to speeding up FDM manufacturing. –Our approach decomposes the desired geometry into a thin sturdy outer shell with a loosely filled center volume. –Our approach saves time and material as compared to the built-in QuickSlice solution.

Thanks to our Sponsors NSF –CyberCut –CADRE: MOSIS++: A Distributed Manufacturing Resource (EIA ) Ford Motor Co.

2D Contour Offset Implementation Difficulties arise from global interactions Robust approach based on Voronoi diagram –Generalization of the approach described by M. Held 1991 InputOffset 0.1Offset 0.2

Voronoi Diagram of a Contour Input sites are both Vertices and directed Edge Segments VD divides the plane into zones s.t. every point in a zone is closest to the corresponding input site than to any other site Vertices of VD have an associated signed distance VD is a signed distance function

Voronoi Mountain Create a height field by raising the vertices of VD in z by their signed distance Offsetting by n is the same as slicing the mountain with the plane z = n z z = 0

Offset Slicing z-monotone parabolic VD edges for each unvisited VD edge if VD edge  z = n Crawl VD CCW around peak CW around each VD face

Dragon Curve Example InputVoronoi DiagramOffset