1 L21: Topology of Microstructure A. D. Rollett 27-750 Spring 2006.

Slides:



Advertisements
Similar presentations
Introduction Think about the dissection arguments used to develop the area of a circle formula. These same arguments can be used to develop the volume.
Advertisements

Extended Gaussian Images
Archimedean Solids By: Nicole Strauss, Carrissa Texley, and Marlene Stockton.
12 VECTORS AND THE GEOMETRY OF SPACE.
L22: Grain Boundary, Surface Energies, Measurement
3. Delaunay triangulation
Chapter 3 Steady-State Conduction Multiple Dimensions
11-1 Space Figures and Cross Sections
Geometry Formulas in Three Dimensions
A Closed Form Simulation of a Coarsening Analog System Vaughan Voller, University of Minnesota a·nal·o·gy Similarity in some respects between things that.
VOCABULARY GEOMETRIC FIGURES. POLYGON Is a closed plane figure formed by three or more line segments that meet at points called vertices.
12.1 Exploring Solids Geometry Mrs. Spitz Spring 2006.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
1. An Overview of the Geometry Standards for School Mathematics? 2.
Platonic Solids. So What is Our Topic?  It’s math (go figure!)  It’s hands on (so you get to play!)  There’s candy involved  There are some objects.
Warm Up Write down objective and homework in agenda Lay out homework (Distance & PT worksheet) Homework (Volume worksheet) Get a calculator!!!
1 (Normal) Grain Growth Texture, Microstructure & Anisotropy A.D. Rollett Updated 5 th Apr
© Imperial College LondonPage 1 Topological Analysis of Packings Gady Frenkel, R. Blumenfeld, M. Blunt, P. King Application to flow properties in granular.
Review of Geometric Shapes
LESSON 10.1 & 10.2 POLYHEDRONS OBJECTIVES: To define polyhedrons To recognize nets of space figures To apply Euler’s formula To describe cross section.
5-Minute Check Name the polygon by the number of sides.
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.
Surprises in high dimensions Martin Lotz Galois Group, April 22, 2015.
Warm-Up Find the area of the kite Question 8 from the Test.
12. Polyhedra
Chapter 11.1 Notes Common Core – G.GMD.4 Identify the shapes of two-dimensional cross-sections of three-dimensional objects, and identify three-dimensional.
Chapter 12 Surface Area and Volume. Chapter 12 Objectives Define polyhedron Define polyhedron Utilize Euler’s Theorem Utilize Euler’s Theorem Identify.
A regular polygon is a polygon with all sides congruent and all angles congruent such as equilateral triangle, square, regular pentagon, regular hexagon,
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.
11.1 Space Figures and Cross Sections A polyhedron is a space figure, or three-dimensional figure, whose surfaces are polygons. Each polygon is a face.
Computer Graphics Basic 3D Geometry CO2409 Computer Graphics Week 5-1.
Beauty, Form and Function: An Exploration of Symmetry
Polyhedron Platonic Solids Cross Section
Euler’s characteristic and the sphere
Warm Up Week 6. Section 12.1 Day 1 I will use the properties of polyhedra. Cross section The intersection of a plane slicing through a solid.
10-1 & 10-2: Space Figures, Nets & Diagrams
By Eugene Adams.  Vertices  Edges  Faces  Polygons  Meshes  2D co-ordinates  3D co-ordinates.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
DRILL How many sides does dodecagon have?
12.1 Exploring Solids.
CHAPTER 2.3 PROBABILITY DISTRIBUTIONS. 2.3 GAUSSIAN OR NORMAL ERROR DISTRIBUTION  The Gaussian distribution is an approximation to the binomial distribution.
Geometry 1 st Grade Geometry Lesson. Content Strand Addressed Geometry Strand Students will: use visualization and spatial reasoning to analyze characteristics.
Section 12-1 Exploring Solids. Polyhedron Three dimensional closed figure formed by joining three or more polygons at their side. Plural: polyhedra.
Surface Area and Volume
Chapter 11: Surface Area & Volume
12.1 Exploring Solids.
Space Figures and Cross Sections. Polyhedra A polyhedron is a three- dimensional figure whose surfaces are polygons. Each polygon is a face of the polyhedron.
polyhedron a three- dimensional figure whose surfaces are polygons faces edge vertex.
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.
(Normal) Grain Growth and Size Distributions Texture, Microstructure & Anisotropy A.D. Rollett Some slides from a 2014 lecture by S.P. Donegan Updated.
Topology and The Euler Number
Curvature driven grain growth
Platonic Solids And Zome System.
Goal 1: Using Properties of Polyhedra Goal 2: Using Euler’s Theorem
Emanuel (Menachem) Lazar, Princeton Robert D. MacPherson, IAS
Introduction to Geometry
Properties of Geometric Shapes
Curl and Divergence.
3D objects Saturday, 17 November 2018.
Planarity and Euler’s Formula
12-1 Properties of Polyhedra
10-1 Vocabulary Face Edge Vertex Prism Cylinder Pyramid Cone Cube Net
Three-Dimensional Object Representation
3D objects Thursday, 28 February 2019.
3D objects: Prisms Thursday, 28 February 2019.
3D objects: Prisms Friday, 05 April 2019.
Three-Dimensional Figures
Presentation transcript:

1 L21: Topology of Microstructure A. D. Rollett Spring 2006

2 Outline Objectives Motivation Quantities, –definitions –measurable –Derivable Problems that use Topology Topology

3 Objectives To describe the important features of grain boundary networks, i.e. their topology. To illustrate the principles used in extracting grain boundary properties (e.g. energy) from geometry+crystallography of grain boundaries: microstructural analysis. To understand how Herring’s equations lead to a method of obtaining (relative) grain boundary (and surface) energies as a function of boundary type. To understand how curvature-driven grain boundary migration leads to a method of obtaining (relative) mobilities. Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

4 Topology - why study it? The behavior of networks of interfaces is largely driven by their topology. The connectivity of the interfaces matters more than dimensions. Example: in a 2D boundary network, whether a grain shrinks or grows depends on the number of sides (von Neumann-Mullins), not its dimensions (although there is a size-no._of_sides relationship). In a 2D grain boundary network, the dihedral angles at triple junctions is 120°. Why? There is a force balance at each triple junction and symmetry dictates that the angles must be equal, therefore each 120°. Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

5 Shrink vs. Grow (Topology) Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions Read: Mullins, W. W. (1956). "Two-dimensional motion of idealized grain boundaries." J. Appl. Phys. 27: ; also Palmer M, Nordberg J, Rajan K, Glicksman M, Fradkov VY. Two-dimensional grain growth in rapidly solidified succinonitrile films. Met. Mater. Trans. 1995;26A:1061. Triple junction

6 Topology of Networks in 3D Consider the body as a polycrystal in which only the grain boundaries are of interest. Each grain is a polyhedron with facets, edges (triple lines) and vertices (corners). Typical structure has three facets meeting at an edge (triple line/junction or TJ); Why 3-fold junctions? Because higher order junctions are unstable [to be proved]. Four edges (TJs) meet at a vertex (corner). Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

7 Definitions G  B = Grain = polyhedral object = polyhedron = body F = Facet = face = grain boundary E = Edge = triple line = triple junction = TJ C  V = Corner = Vertex = points n = number of edges around a facet overbar or indicates average quantity Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

8 Euler’s equations 3D: simple polyhedra (no re-entrant shapes) V + F = E + 2 [G = 1] 3D: connected polyhedra (grain networks) V + F = E + G +1 2D: connected polygons V + F = E + 1 Proof: see What is Mathematics? by Courant & Robbins (1956) O.U.P., pp These relationships apply in all cases with no restrictions on connectivity. Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

9 Grain Networks A consequence of the characteristic that three grain boundaries meet at each edge to form a triple junction is this: 3V = 2E E E E E E E E E E E E E V V V V V V Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions This relationship is particular to grain networks. It is not general because it depends on junctions being triple junctions only (no quadri-junctions, for example).

10 2D sections In a network of 2D grains, each grain boundary has two vertices at each end, each of which is shared with two other grain boundaries (edges): 2/3 E = V, or, 2E = 3V  E = 1.5V Each grain has an average of 6 boundaries and each boundary is shared: = 6: E = /2 G = 3G, or, V = 2/3 E = 2/3 3G = 2G Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

11 2D sections 6-sided grain = unit cell; each vertex has 1/3 in each unit cell; each boundary has 1/2 in each cell split each edge divide each vertex by 3 Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

12 2D Topology: polygons Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

13 3D Topology: polyhedra Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

14 Application: regular shapes For grains in polycrystalline solids, the shapes are approximated by tetrakaidecahedra:  -ttkd to  -ttkd. (a) soap froth; (b) plant pith cells; (c) grains in Al-Sn Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

15 3D von Neumann-Mullins The existence of the n-6 rule in 2D suggests that there might be a similar rule in 3D. The foundation of the n-6 rule is the integration of curvature around the circumference of a grain. In 3D it turns out that integrating the mean curvature around a polyhedron is not possible mathematically. Various approximations have been tried (see, e.g., Hilgenfeldt, S., A. Kraynik, S. Koehler and H. Stone (2001). "An accurate von Neumann's law for three-dimensional foams." Physical Review Letters 86(12): ). Empirically, however, it turns out that there is an F rule that holds, based on several computer simulations. Grains with 14 or more facets grow (on average) whereas grains with 13 or fewer facets shrink. Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

16 3D von Neumann-Mullins Glicksman recently developed a theory based on polyhedra with regular shapes. This predicts a crossing point at N=13.4. See: Glicksman ME, “Analysis of 3-D network structures “;PHILOSOPHICAL MAGAZINE 85 (1): 3-31 JAN Also, Glazier JA. “Grain growth in three dimensions depends on grain topology.” Phys. Rev. Lett. 1993;70:2170.

17 3D vs 2D: polygonal faces Average no. of edges on polygonal faces is less than 6 for typical 3D grains/cells. Typical =5.14 In 2D, =6. Objectives Notation Equations Delesse S V -P L L A -P L Topology Grain_Size Distributions

18 Summary Grain boundary networks obey certain geometrical rules. For example, in 2D, grains have an average of exactly 6 sides. Boundaries generally meet at triple lines, which simplifies some of the topological relationships. Nearly all cellular materials (including biological ones) have very similar topologies. Force balance (Herring relations) at Triple Junctions determines dihedral angles (120° for isotropic boundaries), which in turn determine boundary curvatures for moving boundaries.