Discrete Exterior Calculus How to Turn Your Mesh into a Computational Structure. Discrete Differential Geometry

Similar documents
Discrete Exterior Calculus

Discrete Differential Geometry. Differential Geometry

CS 468 (Spring 2013) Discrete Differential Geometry

Overview. Applications of DEC: Fluid Mechanics and Meshing. Fluid Models (I) Part I. Computational Fluids with DEC. Fluid Models (II) Fluid Models (I)

DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU /858B Fall 2017

Conforming Vector Interpolation Functions for Polyhedral Meshes

Discrete Differential Geometry: An Applied Introduction

Lecture 5: Simplicial Complex

PyDEC: Software and Algorithms for Discretization of Exterior Calculus

CS Fall Homework 3: Vector Field Decomposition Due November 18th before midnight Please send your pdf and code to

A Primer on Laplacians. Max Wardetzky. Institute for Numerical and Applied Mathematics Georg-August Universität Göttingen, Germany

Lecture 0: Reivew of some basic material

Topological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College

Dual Interpolants for Finite Element Methods

Discrete Surfaces. David Gu. Tsinghua University. Tsinghua University. 1 Mathematics Science Center

Simplicial Complexes: Second Lecture

1 Discrete Connections

Persistent Homology and Nested Dissection

Math 635: Algebraic Topology III, Spring 2016

Surfaces: notes on Geometry & Topology

Euler s Theorem. Brett Chenoweth. February 26, 2013

Lectures in Discrete Differential Geometry 3 Discrete Surfaces

4. Simplicial Complexes and Simplicial Homology

Shape Modeling and Geometry Processing

66 III Complexes. R p (r) }.

Diamonds: Finite Element/Discrete Mechanics schemes with guaranteed optimal convergence

THE RISE, FALL AND RISE OF SIMPLICIAL COMPLEXES. Andrew Ranicki (Edinburgh) aar Warwick 2nd February, 2018

Definition A metric space is proper if all closed balls are compact. The length pseudo metric of a metric space X is given by.

Cambridge University Press Hyperbolic Geometry from a Local Viewpoint Linda Keen and Nikola Lakic Excerpt More information

Diffusion Maps and Topological Data Analysis

Discrete Poincaré lemma

Simplicial Hyperbolic Surfaces

Geometric structures on 2-orbifolds

GAUSS-BONNET FOR DISCRETE SURFACES

The Cyclic Cycle Complex of a Surface

Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass

Discrete Conformal Structures

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3

Finite Element Methods

HOMOLOGY. Equivalently,

Geometry Processing & Geometric Queries. Computer Graphics CMU /15-662

CAT(0)-spaces. Münster, June 22, 2004

Analysis of high dimensional data via Topology. Louis Xiang. Oak Ridge National Laboratory. Oak Ridge, Tennessee

Orientation of manifolds - definition*

arxiv: v1 [math.gt] 28 Feb 2009

Surfaces, meshes, and topology

Coxeter Groups and CAT(0) metrics

PERSISTENT HOMOLOGY OF FINITE TOPOLOGICAL SPACES

Math 5593 Linear Programming Lecture Notes

Homology and Persistent Homology Bootcamp Notes 2017

Three Points Make a Triangle Or a Circle

3D Modeling Parametric Curves & Surfaces

THE BASIC THEORY OF PERSISTENT HOMOLOGY

Observing Information: Applied Computational Topology.

Exact discrete Morse functions on surfaces. To the memory of Professor Mircea-Eugen Craioveanu ( )

Research in Computational Differential Geomet

A Flavor of Topology. Shireen Elhabian and Aly A. Farag University of Louisville January 2010

Reflection groups 4. Mike Davis. May 19, Sao Paulo

Computational Topology in Reconstruction, Mesh Generation, and Data Analysis

Scientific Computing WS 2018/2019. Lecture 12. Jürgen Fuhrmann Lecture 12 Slide 1

3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013

Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary?

The Charney-Davis conjecture for certain subdivisions of spheres

Geometric and Solid Modeling. Problems

Introduction to Coxeter Groups

Cell-Like Maps (Lecture 5)

DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU /858B Fall 2017

CS-184: Computer Graphics. Today

POINT SET TOPOLOGY. Introduction

Lecture 3A: Generalized associahedra

Invariant Measures. The Smooth Approach

The basics of rigidity

Homology of Simplicial Complexes

Outline. Visualization Discretization Sampling Quantization Representation Continuous Discrete. Noise

Given four lines in space, how many lines meet all four?: The geometry, topology, and combinatorics of the Grassmannian

Computational Geometry Lab: SEARCHING A TETRAHEDRAL MESH

CS 468 (Spring 2013) Discrete Differential Geometry

Math 734 Aug 22, Differential Geometry Fall 2002, USC

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]

Introduction to Immersion, Embedding, and the Whitney Embedding Theorems

Convex Hulls (3D) O Rourke, Chapter 4

Lecture notes for Topology MMA100

PRESCRIBING CURVATURE FOR PIECEWISE FLAT TRIANGULATED 3-MANIFOLDS

Mathematical Research Letters 1, (1994) MÖBIUS CONE STRUCTURES ON 3-DIMENSIONAL MANIFOLDS. Feng Luo

Computing the Betti Numbers of Arrangements. Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology.

MATH 890 HOMEWORK 2 DAVID MEREDITH

COMBINATORIAL METHODS IN ALGEBRAIC TOPOLOGY

Lecture 7: Jan 31, Some definitions related to Simplical Complex. 7.2 Topological Equivalence and Homeomorphism

Simplicial volume of non-compact manifolds

Mesh Repairing and Simplification. Gianpaolo Palma

Sheaf Theory Approach to Distributed Applications: Analysing Heterogeneous Data in Air Traffic Monitoring

Topological Decompositions for 3D Non-manifold Simplicial Shapes

Know it. Control points. B Spline surfaces. Implicit surfaces

Geometric Modeling in Graphics

Braid groups and buildings

Using Semi-Regular 4 8 Meshes for Subdivision Surfaces

CS-184: Computer Graphics

As a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9.

Stable and Multiscale Topological Signatures

Transcription:

Discrete Exterior Calculus How to Turn Your Mesh into a Computational Structure Discrete Differential Geometry Big Picture Deriving a whole Discrete Calculus you need first a discrete domain will induce the notion of chains discrete representation of geometry then discrete differential operators applied to our discrete geometric set-up defined through cochains (discrete forms) Scared? Don t be: just numbers on mesh elmts! 2

Part I Discrete Geometric Setup 3 Discrete Setup Starting with a discrete domain can be thought of as approximation cell decomposition of smooth manifold Nice simplicial mesh vertex, edge, triangles, 4

Discrete Setup Starting with a discrete domain can be thought of as approximation cell decomposition of smooth manifold Nice simplicial mesh vertex, edge, triangles, 2D domain 5 Discrete Setup Starting with a discrete domain can be thought of as approximation cell decomposition of smooth manifold Nice simplicial mesh vertex, edge, triangles, 2D domain curved 2D domain 6

Discrete Setup Starting with a discrete domain can be thought of as approximation cell decomposition of smooth manifold Nice simplicial mesh vertex, edge, triangles, 2D domain curved 2D domain 3D domain or even 4D and more! 7 Quick Refresher Course Notion of k-simplex non-degenerate convex hull of (k+1) vertices 0-simplex 1-simplex 2-simplex 3-simplex boundary of simplex? = +1 = = -1 simplicial complex your typical triangle mesh/tet mesh two k-simplices only intersect thru a common (k-1)-face = 8

Discrete Subdomains How to define geometric subsets? again, the only medium we have is the mesh simple example: 9 Discrete Subdomains How to define geometric subsets? again, the only medium we have is the mesh simple example: how to define this region? voxelized is ok, but not great heard about antialiasing? 10

Notion of Chains Allowing linear combination of simplices assign coefficients to simplices = -1 +1 not just 0 or 1 it s called a chain we ve seen it before: think boundary of an edge Definition: k-chain = one value per k-simplex think column vector or simply an array of values in CS terms 11 Chains and Boundaries Boundary of a chain is a chain: chains allow sub-simplex accuracy anti-aliased version chains extension of barycentric coordinates! notion of homology v 1 x v 2 v 0 12

Notion of Dual Complex Associate to each k-simplex a (n-k)-cell connectivity of mesh induces another mesh Voronoi diagram Primal k-simplex Dual (n-k)-cell Chains are defined as well on dual mesh! dual of k-simplex, so same cardinality Primal Dual 13 Part II Turning our Mesh into a Computational Structure 14

Intrinsic Calculus on Meshes Ready to bootstrap a discrete calculus using only values on simplices measurements in the domain preview: point-based scalar field d deep roots in mathematics exterior calculus, algebraic topology but very simple to implement and use edge-based vector field d face-based vector field d cell-based scalar field 15 Discrete Differential Quantities Mentioned repeatedly in the talks before they live at special places, as distributions Gaussian curvature at vertices ONLY mean curvature at edges ONLY they can be handled through integration integration calls for k-forms (antisymmetric tensors) objects that beg to be integrated(e.g. f ( x) dx) k-forms are evaluated on kd set 0-form is evaluated at a point, 1-form at a curve, etc that s a 1-form what you can measure 16

Forms You Know For Sure Digital Images: 2-forms incident flux on sensors (W/m 2 ) hmm, looks like a chain, no? (almost) Magnetic Field B: 2-form B n. da only measurement possible: flux! any physical flux is a 2-form too Electrical Force E: 1-form any physical circulation is a 1-form too notion of pseudo forms see notes E t. dl n t 17 Exterior Calculus of Forms Foundation of calculus on smooth manifolds Historically, purpose was to extend div/curl/grad Poincaré, Cartan, Lie, Basis of differential and integral computations highlights topological and geometrical structures modern diff. geometry, Hodge decomposition, A hierarchy of basic operators are defined: d, *,, b, #, i X, L X See [Abraham, Marsden, Ratiu], ch. 6-7 18

Discrete Forms? Idea: Sampling Forms on Each Simplex extends the idea of point-sampling of fcts sample (i.e., integrate) a k-form on k-cells the rest is defined by linearity ex: if we know the flux on each edge, flux over the boundary of triangle is just the sum of the fluxes a+b+c b c a 19 Discrete Forms As Cochains Discrete k-form = values on each kd set primal forms on simplices, dual forms on cells Not a chain! Think row vector this time in CS terms: k-form = array of values too These discrete forms are cochains in math terms: chains pair with cochains (natural pairing = integration) if chain c valued on & form valued on, 20

Notion of Exterior Derivative Stokes/Green/{ } theorem: b a df F( b) F( a) a df b d and are dual Implementation? As simple as an incidence matrix! ex: d(1-form)=incidence matrix of edges & faces Bean counting: array[ F x E ] x array E = array F d b a = c = a+b+c d d d turns an integral into a boundary integral 21 Exterior Derivative Let s try -2-1 value? Careful w/ orientation! ( )= No metric needed! (no size measurement) Try d, then d again on an arbitrary form zero; why? because good: div(curl)=curl(grad)=0 automatically 22

Hodge Star Take forms to dual complex (and vice-versa) switch values btw primal/dual diagonal hodge star again, a simple (diagonal) matrix now the metric enters Hodge star defines accuracy common average value 23 Discrete derham Complex Discrete calculus through linear algebra: point-based scalar field edge-based vector field face-based vector field cell-based scalar field cell-based scalar field face-based edge-based vector field vector field simple exercise in matrix assembly all made out of two trivial operations: summing values on simplices (d/ ) scaling values based on local sizes ( ) point-based scalar field 24

Interpolating Discrete Forms Whitney basis functions to interpolate forms 0-forms (functions) linear hat functions 1-forms (edge elements!) Whitney forms: basis of 1-forms since 0 on edges (i,j) 2-forms: face elmts 3-forms: constant per tet Higher order bases? See [Ke Wang et al. 2006] also a fct of think for computations and 25 What We ll Be Able To Do 26

Other Related Research Areas Geometric Algebra Mimetic Differencing same spirit, less geometry Finite {Element Volume Differences} Discrete Mechanics what about time discretization now? principle of least-action is crucial motion is a geodesic if we use action as metric 27 Take-Home Message Geometric Approach to Computations discrete setup acknowledged from the getgo choice of proper habitat for quantities whole calculus built using only: boundary of mesh elements scaling by local measurements preserving structural indentities they are not just abstract concepts: they represent defining symmetries 28

Join the Discrete World Wanna know more about DEC? Chapter in course notes Discrete Differential Forms by MD, Eva Kanso, Yiying Tong much more details and pointers to literature: homology, cohomology, Hodge decomposition living document please help us improving it Another chapter in the course notes: Build Your Own DEC at Home by Sharif Elcott & Peter Schröder 29