Lecture 5: Triangulations & simplicial complexes (and cell complexes). in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305)

Slides:



Advertisements
Similar presentations
Lecture 6: Creating a simplicial complex from data. in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology:
Advertisements

Tyler White MATH 493 Dr. Wanner
CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Shape Analysis (Part II) Fall 2014.
Homology Groups And Persistence Homology
Matthew L. WrightMatthew L. Wright Institute for Mathematics and its ApplicationsInstitute for Mathematics and its Applications University of MinnesotaUniversity.
Applications of Euler’s Formula for Graphs Hannah Stevens.
Proximity graphs: reconstruction of curves and surfaces
Lecture 1: The Euler characteristic of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology: Scientific.
Topological Data Analysis
©2008 I.K. Darcy. All rights reserved This work was partially supported by the Joint DMS/NIGMS Initiative to Support Research in the Area of Mathematical.
Euler’s Formula Classifying Three Dimensional Shapes Any Observations?
Simplicial Sets, and Their Application to Computing Homology Patrick Perry November 27, 2002.
Mesh Smoothing and Untangling Optimization of vertex locations in simplicial meshes. Sean Mauch Caltech October, 2003.
Introductory Notes on Geometric Aspects of Topology PART I: Experiments in Topology 1964 Stephen Barr (with some additional material from Elementary Topology.
CTIS 154 Discrete Mathematics II1 8.2 Paths and Cycles Kadir A. Peker.
©A. Weinberg By Ms. Weinberg SOL ©A. Weinberg Let’s learn a bit about Geometry! Geometry is a part of Math that focuses on shapes and lines. Shapes.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Matthew Bowling Euler’s Theorem Mathfest Spring ‘15.
CS 257 Database Systems Dr. T Y Lin Ultimate Goal Data Science (Big Data)
Reviewing Properties of 3D figures
Geometric Perspectives. Everything has a name… Face Corner (Vertex) Edges.
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Lecture 4: Addition (and free vector spaces) of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology:
Topological Data Analysis
Lecture 2: Addition (and free abelian groups) of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology:
Let C be the simplicial complex on the right (the boundary of a tetrahedron). Find the following: C 0 = C 1 = C 2 = C 3 = Z 0 = Explain your answer for.
Euler’s characteristic and the sphere
Optional Lecture: A terse introduction to simplicial complexes in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305)
Creating a simplicial complex Step 0.) Start by adding 0-dimensional vertices (0-simplices)
Lecture 3: Modular Arithmetic of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology: Scientific and.
Introductory Notes on Geometric Aspects of Topology PART I: Experiments in Topology 1964 Stephen Barr (with some additional material from Elementary Topology.
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Sept 9, 2013: Create your own homology. Fall 2013.
1 Overview (Part 1) Background notions A reference framework for multiresolution meshes Classification of multiresolution meshes An introduction to LOD.
Section 12-1 Exploring Solids. Polyhedron Three dimensional closed figure formed by joining three or more polygons at their side. Plural: polyhedra.
Welcome to MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Week 1: Introduction to Topological Data.
Euler characteristic (simple form):
Algebraic Topology Dr. SOHAIL IQBAL MTH 477 For Master of Mathematics
Sajid Ghuffar 24.June  Introduction  Simplicial Complex  Boundary Operator  Homology  Triangulation  Persistent Homology 6/24/ Persistence.
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Sept 16, 2013: Persistent homology III Fall 2013.
Topology Preserving Edge Contraction Paper By Dr. Tamal Dey et al Presented by Ramakrishnan Kazhiyur-Mannar.
1 ALGEBRAIC TOPOLOGY SIMPLICAL COMPLEX ALGEBRAIC TOPOLOGY SIMPLICAL COMPLEX Tsau Young (‘T. Y.’) Lin Institute of Data Science and Computing and Computer.
Creating a cell complex = CW complex Building block: n-cells = { x in R n : || x || ≤ 1 } 2-cell = open disk = { x in R 2 : ||x || < 1 } Examples: 0-cell.
Sept 25, 2013: Applicable Triangulations.
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
We propose a method which can be used to reduce high dimensional data sets into simplicial complexes with far fewer points which can capture topological.
Creating a cell complex = CW complex
Dec 2, 2013: Hippocampal spatial map formation
Sept 23, 2013: Image data Application.
Main Project total points: 500
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Nov 20, 2013: Intro to RNA & Topological Landscapes.
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Nov 22, 2013: Topological methods for exploring low-density.
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Oct 21, 2013: Cohomology Fall 2013 course offered.
Dec 4, 2013: Hippocampal spatial map formation
Unit 3 – Lesson 6 Solids.
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Nov 8, 2013: DNA Topology Fall 2013 course offered.
Non-manifold Multiresolution Modeling (some preliminary results)
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Clustering Via Persistent Homology
Topological Data Analysis
Algebraic Topology Simplical Complex
e2 e1 e5 e4 e3 v1 v2 v3 v4 f The dimension of f = 2
CSE 554 Lecture 3: Shape Analysis (Part II)
Unstructured grid: an introduction
Discrete Mathematics for Computer Science
e2 e1 e5 e4 e3 v1 v2 v3 v4 f The dimension of f =
A Portrait of a Group on a Surface with Boundary
Chapter 3: Simplicial Homology Instructor: Yusu Wang
Lecture 5: Triangulations & simplicial complexes (and cell complexes).
Drawing a graph
Presentation transcript:

Lecture 5: Triangulations & simplicial complexes (and cell complexes). in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Target Audience: Anyone interested in topological data analysis including graduate students, faculty, industrial researchers in bioinformatics, biology, business, computer science, cosmology, engineering, imaging, mathematics, neurology, physics, statistics, etc. Isabel K. Darcy Mathematics Department/Applied Mathematical & Computational Sciences University of Iowa

v2v2 e2e2 e1e1 e3e3 v1v1 v3v3 2-simplex = triangle = {v 1, v 2, v 3 } Note that the boundary of this triangle is the cycle e 1 + e 2 + e 3 = {v 1, v 2 } + {v 2, v 3 } + {v 1, v 3 } 1-simplex = edge = {v 1, v 2 } Note that the boundary of this edge is v 2 + v 1 e v1v1 v2v2 0-simplex = vertex = v Building blocks for a simplicial complex

3-simplex = {v 1, v 2, v 3, v 4 } = tetrahedron boundary of {v 1, v 2, v 3, v 4 } = {v 1, v 2, v 3 } + {v 1, v 2, v 4 } + {v 1, v 3, v 4 } + {v 2, v 3, v 4 } n-simplex = {v 1, v 2, …, v n+1 } v4v4 v3v3 v1v1 v2v2 Building blocks for a simplicial complex

3-simplex = {v 1, v 2, v 3, v 4 } = tetrahedron boundary of {v 1, v 2, v 3, v 4 } = {v 1, v 2, v 3 } + {v 1, v 2, v 4 } + {v 1, v 3, v 4 } + {v 2, v 3, v 4 } n-simplex = {v 1, v 2, …, v n+1 } v4v4 v3v3 v1v1 v2v2 Building blocks for a simplicial complex v4v4 v3v3 v1v1 v2v2 Fill in

Creating a simplicial complex 0.) Start by adding 0-dimensional vertices (0-simplices)

Creating a simplicial complex 1.) Next add 1-dimensional edges (1-simplices). Note: These edges must connect two vertices. I.e., the boundary of an edge is two vertices

Creating a simplicial complex 1.) Next add 1-dimensional edges (1-simplices). Note: These edges must connect two vertices. I.e., the boundary of an edge is two vertices

Creating a simplicial complex 1.) Next add 1-dimensional edges (1-simplices). Note: These edges must connect two vertices. I.e., the boundary of an edge is two vertices

Creating a simplicial complex 2.) Add 2-dimensional triangles (2-simplices). Boundary of a triangle = a cycle consisting of 3 edges.

Creating a simplicial complex 2.) Add 2-dimensional triangles (2-simplices). Boundary of a triangle = a cycle consisting of 3 edges.

Creating a simplicial complex 3.) Add 3-dimensional tetrahedrons (3-simplices). Boundary of a 3-simplex = a cycle consisting of its four 2-dimensional faces.

Creating a simplicial complex 3.) Add 3-dimensional tetrahedrons (3-simplices). Boundary of a 3-simplex = a cycle consisting of its four 2-dimensional faces.

4.) Add 4-dimensional 4-simplices, {v 1, v 2, …, v 5 }. Boundary of a 4-simplex = a cycle consisting of 3-simplices. = {v 2, v 3, v 4, v 5 } + {v 1, v 3, v 4, v 5 } + {v 1, v 2, v 4, v 5 } + {v 1, v 2, v 3, v 5 } + {v 1, v 2, v 3, v 4 }

Creating a simplicial complex n.) Add n-dimensional n-simplices, {v 1, v 2, …, v n+1 }. Boundary of a n-simplex = a cycle consisting of (n-1)-simplices.

circle = { x in R 2 : ||x || = 1 } Example: Triangulating the circle.

circle = { x in R 2 : ||x || = 1 } Example: Triangulating the circle.

circle = { x in R 2 : ||x || = 1 } Example: Triangulating the circle.

circle = { x in R 2 : ||x || = 1 } Example: Triangulating the circle.

circle = { x in R 2 : ||x || = 1 } Example: Triangulating the circle.

disk = { x in R 2 : ||x || ≤ 1 } Example: Triangulating the disk.

disk = { x in R 2 : ||x || ≤ 1 } Example: Triangulating the disk.

disk = { x in R 2 : ||x || ≤ 1 } Example: Triangulating the disk.

disk = { x in R 2 : ||x || ≤ 1 } Example: Triangulating the disk.

disk = { x in R 2 : ||x || ≤ 1 } = Example: Triangulating the disk.

sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere.

sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere.

sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere.

sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere.

Example: Triangulating the circle. disk = { x in R 2 : ||x || ≤ 1 } =

Example: Triangulating the circle. disk = { x in R 2 : ||x || ≤ 1 }

Example: Triangulating the circle. disk = { x in R 2 : ||x || ≤ 1 } Fist image from

sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere.

sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere. =

Creating a cell complex Building block: n-cells = { x in R n : || x || ≤ 1 } Examples: 0-cell = { x in R 0 : ||x || < 1 } 1-cell =open interval ={ x in R : ||x || < 1 } ( ) 3-cell = open ball = { x in R 3 : ||x || < 1 } 2-cell = open disk = { x in R 2 : ||x || < 1 }

v2v2 e2e2 e1e1 e3e3 v1v1 v3v3 2-simplex = triangle = {v 1, v 2, v 3 } Note that the boundary of this triangle is the cycle e 1 + e 2 + e 3 = {v 1, v 2 } + {v 2, v 3 } + {v 1, v 3 } 1-simplex = edge = {v 1, v 2 } Note that the boundary of this edge is v 2 + v 1 e v1v1 v2v2 0-simplex = vertex = v Building blocks for a simplicial complex

3-simplex = {v 1, v 2, v 3, v 4 } = tetrahedron boundary of {v 1, v 2, v 3, v 4 } = {v 1, v 2, v 3 } + {v 1, v 2, v 4 } + {v 1, v 3, v 4 } + {v 2, v 3, v 4 } n-simplex = {v 1, v 2, …, v n+1 } v4v4 v3v3 v1v1 v2v2 v4v4 v3v3 v1v1 v2v2 Fill in Building blocks for a simplicial complex

Creating a cell complex Building block: n-cells = { x in R n : || x || ≤ 1 } 2-cell = open disk = { x in R 2 : ||x || < 1 } 3-cell = open ball = { x in R 3 : ||x || < 1 } Examples: 0-cell = { x in R 0 : ||x || < 1 } 1-cell =open interval ={ x in R : ||x || < 1 } ( )

Creating a cell complex Building block: n-cells = { x in R n : || x || ≤ 1 } 2-cell = open disk = { x in R 2 : ||x || < 1 } Examples: 0-cell = { x in R 0 : ||x || < 1 } 1-cell =open interval ={ x in R : ||x || < 1 } ( ) 3-cell = open ball = { x in R 3 : ||x || < 1 }

Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex

Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex

Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex ( ) U

Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex [ ] U

Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex [ ] U =

Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex [ ] U = U

Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex [ ] U = U =

Euler characteristic (simple form): = number of vertices – number of edges + number of faces Or in short-hand, = |V| - |E| + |F| where V = set of vertices E = set of edges F = set of 2-dimensional faces & the notation |X| = the number of elements in the set X.

Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex 3 vertices, 3 edges, 1 triangle Cell complex 1 vertex, 1 edge, 1 disk. [ ] U = U =

Euler characteristic: Given a simplicial complex C, let C n = the set of n-dimensional simplices in C, and let |C n | denote the number of elements in C n. Then = |C 0 | - |C 1 | + |C 2 | - |C 3 | + … = Σ (-1) n |C n |

Euler characteristic: Given a cell complex C, let C n = the set of n-dimensional cells in C, and let |C n | denote the number of elements in C n. Then = |C 0 | - |C 1 | + |C 2 | - |C 3 | + … = Σ (-1) n |C n |

Example: sphere = { x in R 3 : ||x || = 1 } Simplicial complex 4 vertices, 6 edges, 4 triangles Cell Complex 1 vertex, 1 disk = U =

Example: sphere = { x in R 3 : ||x || = 1 } U = Simplicial complex Cell complex =

Example: sphere = { x in R 3 : ||x || = 1 } U = Simplicial complex Cell complex U =

Example: sphere = { x in R 3 : ||x || = 1 } U = Simplicial complex Cell complex U = =

Example: sphere = { x in R 3 : ||x || = 1 } U = Simplicial complex Cell complex U = = Fist image from

Example: sphere = { x in R 3 : ||x || = 1 } U = Cell complex U = =

Example: sphere = { x in R 3 : ||x || = 1 } U = Cell complex U = =

Example: sphere = { x in R 3 : ||x || = 1 } U = Simplicial complex Cell complex Cell complex U = =