Conforming Vector Interpolation Functions for Polyhedral Meshes
|
|
- Pierce Russell
- 5 years ago
- Views:
Transcription
1 Conforming Vector Interpolation Functions for Polyhedral Meshes Andrew Gillette joint work with Chandrajit Bajaj and Alexander Rand Department of Mathematics Institute of Computational Engineering and Sciences University of Texas at Austin, USA Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL -and JanSciences 20 University / 29
2 Interpolation in Graphics vs. Simulation Interpolation of vector fields required for geometric design. No natural constraints on interpolation properties. Some exploration of scalar interpolation over polyhedra. Coupled vector fields related by integral and differential equations. Physical nature of problem offers natural discretizations of variables and boundary conditions. Discrete Exterior Calculus suggests a need for vector interpolation over polyhedra. Goal: Develop a theory of vector interpolation over polyhedra conforming to physical requirements with provable error estimates. Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL -and JanSciences 20 University 2 / 29
3 Motivation Many authors (Bossavit, Hiptmair, Shashkov,...) have recognized the natural interplay between primal and dual domain meshes for discretization of physical equations. Potential benefits of a theory based on interpolation over dual meshes: Accuracy vs. speed tradeoffs available between primal and dual methods. 2 Error estimates for dual interpolation methods analogous to standard estimates. 3 Validation of primal-based results with dual-based discretization methods. Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL -and JanSciences 20 University 3 / 29
4 Outline Background on Vector Interpolation 2 Novel Discretizations Using Polyhedral Vector Interpolation 3 Error Estimates for Polyhedral Vector Interpolation Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL -and JanSciences 20 University 4 / 29
5 Outline Background on Vector Interpolation 2 Novel Discretizations Using Polyhedral Vector Interpolation 3 Error Estimates for Polyhedral Vector Interpolation Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL -and JanSciences 20 University 5 / 29
6 H(Curl) versus H(Div) Throughout, we will consider a model problem from magnetostatics: Domain: Contractible 3-manifold Ω R 3 with boundary Γ Variables: b h Input: Equations: j (magnetic field / magnetic induction) (magnetizing field / auxiliary magnetic field) (current density field) div b = 0, b = h, curl h = j Boundary Conditions: Γ written as a disjoint union Γ e Γ h such that ˆn b = 0 on Γ e, ˆn h = 0 on Γ h. While b and h are both discretized as vector fields, they lie in different function spaces: h H(curl ) := { ( 3 ( ) } 3 v L (Ω)) 2 s.t. v L 2 (Ω) b H(div ) := { ( } 3 v L (Ω)) 2 s.t. v L 2 (Ω) omputational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL -and JanSciences 20 University 6 / 29
7 Local Conformity Constraints Functional continuity can be enforced on a mesh T by imposing certain constraints at each face F = T T 2, involving the normals to the mesh elements T, T 2 : H(curl ) := { ( 3 ( ) } 3 v L (Ω)) 2 s.t. v L 2 (Ω) h H(curl ) h T ˆn + h T2 ˆn 2 = 0, F T H(div ) := { ( } 3 v L (Ω)) 2 s.t. v L 2 (Ω) b H(div ) b T ˆn + b T2 ˆn 2 = 0, F T These constraints hold for primal meshes (T i =tetrahedra) and dual meshes (T i =polyhedra). Goal: Solve for h and b as functions defined piecewise over T, guaranteed to satisfy the applicable conformity constraints. Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL -and JanSciences 20 University 7 / 29
8 Whitney Elements for Primal Meshes The Whitney elements provide a simple and canonical way to construct piecewise functions over a primal mesh T in H(curl ) or H(div ): y 0 Start with linear barycentric coordinates: λ i (v j ) = δ ij x y λ i d.o.f. per vertex x Define for each edge v i v j :: η ij := λ i λ j λ j λ i <y, x> < y, x> 2 Define for each face v i v j v k : η ijk := λ i λ j λ k + λ j λ k λ i +λ k λ i λ j < y, x> η ij d.o.f. per edge < x, y, z >, < x, y, z > < x, y, z >, < x, y, z > η ijk d.o.f. per face omputational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL -and JanSciences 20 University 8 / 29
9 Whitney Elements for Primal Meshes In 3D, it can be shown that the η ij satisfy the H(curl ) constraints and the η ijk satisfy the H(div ) constraints. See, e.g. Bossavit Computational Electromagnetism, 998. Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL -and JanSciences 20 University 9 / 29
10 Discrete derham Diagrams We now have a basis for finite dimensional subspaces of the derham Diagram: H d 0 H(curl ) grad {λ i } D 0 {η ij } (grad) d H(div ) curl D {η ijk } (curl) d 2 L 2 div D 2 {χ T } (div) These are called the primal cochain spaces in Discrete Exterior Calculus: C 0 D 0 (grad) C D (curl) C 2 D 2 C 3 (div) Supposing for a moment we can construct conforming interpolation functions on the dual mesh, we also have a sequence of dual cochain spaces: C 3 D T 0 (div) C 2 DT (curl) C DT 2 C 0 (grad) DESBRUN, HIRANI, LEOK, MARSDEN Discrete Exterior Calculus, arxiv:math/050834v2 [math.dg], 2005 Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences0 University / 29
11 Discrete Exterior Derivative The discrete exterior derivative D is the transpose of the boundary operator D matrix with entries 0, ± The discrete exterior derivative on the dual mesh is D T D T matrix 3 with entries 3 0, ± These cochain vectors and derivative matrices are the building blocks for equation discretization. Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences University / 29
12 Outline Background on Vector Interpolation 2 Novel Discretizations Using Polyhedral Vector Interpolation 3 Error Estimates for Polyhedral Vector Interpolation Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences2 University / 29
13 Discrete Magnetostatics - Primal Returning to the magnetostatics problem, we can discretize the equations in two ways: Continuous Equations: div b = 0, b = h, curl h = j Primal Discrete Equations, with b as a primal 2-cochain: D 2 B = 0, M 2 B = H, D T H = J. Dual Discrete Equations, with b as a dual 2-cochain: D T 0 B = 0, M B = H, D H = J. The discrete Hodge Star M transfers information between complementary dimensions on dual meshes. In this example, we use the identity matrix for M M 5 5 matrix Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences3 University / 29
14 Discrete Hodge Stars Discretization of the Hodge star operator is non-canonical. Existing inverse discrete Hodge stars are either too full or too empty for use in discretizations on dual meshes We present a novel dual discrete Hodge star for this purpose using polyhedral vector interpolation functions primal mesh simplex σ k dual mesh cell σ k type reference definition M k M k DIAGONAL [Desbrun et al.] (M Diag k ) ij := σk i δ σj k ij diagonal diagonal WHITNEY [Dodziuk],[Bell] (M Whit k ) ij := η σ k η i σ k j T sparse (full) DUAL [G, Bajaj] ((M Dual k ) ) ij := η σ k η i σ k (full) sparse j T Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences4 University / 29
15 Condition Number of Discrete Hodge Stars Theorem [G, Bajaj] The condition number of ( M Dual k condition number of M Diag k ) is governed by different mesh criteria than the and M Whit k. v = (0, 0) v 3 = (P, ) 2 v 2 = (0, ) v 4 = ( P, ) 2 Condition numbers as functions of P: P M Diag M Whit ( M Dual ) order O(P) O(P) O() Dual Formulations of Mixed Finite Element Methods. Submitted, 200. omputational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences5 University / 29
16 Dual-based Linear Systems Independence of primal and dual discrete Hodge stars implies accuracy vs. speed tradeoffs are possible between primal and dual methods. Ex: Fewer elements in dual mesh smaller system faster. Ex: Better condition number in dual system more accurate. Primal Linear System, with b as a primal 2-cochain: D 2 B = 0, M 2 B = H, D T H = J. ( ) ( ) ( ) M2 D T 2 B H0 =. D 2 0 P 0 Here, H 0 C satisfies D T H 0 = J and H is defined by H := H 0 + D T 2 P. Thus D T H = DT (H 0 + D T 2 P) = J is assured. Dual Linear System, with b as a dual 2-cochain: M D T 0 B = 0, B = H, D H = J. ( ) ( ) ( ) M D 0 B H0 D T =. 0 0 P 0 Here, H 0 C satisfies D H 0 = J and H is defined by H := M B. Thus D H = D (H 0 + D 0 P) = J is assured. Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences6 University / 29
17 Dual-based Linear Systems The duality of the systems is easily visualized via the cochain sequences: C 0 (grad) C (curl) C 2 (div) C 3 (M ) H 0 B J (D 0 ) T D J B (D ) T H M 2 D 2 0 C 3 C 2 (div) (curl) C (grad) C 0 Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences7 University / 29
18 The DEC-deRham Diagram for R 3 We combine the Discrete Exterior Calculus maps with the L 2 derham sequence. derham: H grad I 0 P 0 H(curl ) P curl H(div ) primal: C 0 D 0 C D C 2 D 2 M 0 dual: C 3 M 0 (D 0 ) T I M C 2 M (D ) T I 2 M 2 C P 2 M 2 div (D 2 ) T L 2 I 3 M 3 C 3 C 0 P 3 M 3 The combined diagram can be used to formulate dual-based discretizations for many problems including electromagnetics, Darcy flow, and electrodiffusion. The question remains: How do we construct polyhedral vector interpolation functions? Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences8 University / 29
19 Outline Background on Vector Interpolation 2 Novel Discretizations Using Polyhedral Vector Interpolation 3 Error Estimates for Polyhedral Vector Interpolation Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences9 University / 29
20 Scalar Interpolation: Generalized Barycentric Functions Let Ω be a convex polygon in R 2 with vertices v,..., v n. Functions λ i : Ω R, i =,..., n are called barycentric coordinates on Ω if they satisfy two properties: Non-negative: λ i 0 on Ω. 2 Linear Completeness: For any linear function L : Ω R, L = n L(v i )λ i. It can be shown that any set of barycentric coordinates under this definition also satisfy: n 3 Partition of unity: λ i. y 4 Linear precision: i= n v i λ i (x) = x. i= 5 Interpolation: λ i (v j ) = δ ij. x y i= x Theorem [Warren, 2003] If the λ i are rational functions of degree n 2, then they are unique. Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences20 University / 29
21 Triangulation Coordinates Let T be a triangulation of Ω formed by adding edges between the v j in some fashion. Define : Ω R λ Tri i,t to be the barycentric function associated to v i on triangles in T containing v i and identically 0 otherwise. Trivially, these are barycentric coordinates on Ω. Theorem [Floater, Hormann, Kós, 2006] For a fixed i, let T m denote any triangulation with an edge between v i and v i+. Let T M denote the triangulation formed by connecting v i to all the other v j. Any barycentric coordinate function λ i satisfies the bounds 0 λ Tri i,t m (x) λ i (x) λ Tri i,t M (x), x Ω. () Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences2 University / 29
22 Wachspress Coordinates Let x Ω and define A i (x) and B i as the areas shown. Define the Wachspress weight function as w Wach i (x) = B i j i,i A j (x). The Wachspress coordinates are then given by the rational functions λ Wach i (x) = wi Wach n j= w Wach j (x) (x) (2) Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences22 University / 29
23 Wachspress Coordinates Example Let x = v. Note A (x) = area of (v, v, v 2 ) = 0. Similarly A 5(x) = 0 λ Wach w Wach (x) = B A 2 (x)a 3 (x)a 4 (x) = W w Wach 2 (x) = B 2 A 3 (x)a 4 (x)a 5(x) = 0 w Wach 3 (x) = B 3 A 4 (x)a 5(x)A (x) = 0 w Wach 4 (x) = B 4 A 5(x)A (x)a 2 (x) = 0 w Wach 5 (x) = B 5A (x)a 2 (x)a 3 (x) = 0 (x) = w Wach (x) w Wach i (x) = W W = 2 (x) = w 2 Wach (x) w Wach (x) = 0 λ Wach Similarly λ Wach 3 (x) = λ Wach 4 (x) = λ Wach 5 (x) = 0. This is an illustration of the property λ Wach i (v j ) = δ ij Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences23 University / 29
24 Sibson (Natural Neighbor) Coordinates Let P denote the set of vertices {v i } and define P = P {x}. C i := V P (v i ) = {y Ω : y v i < y v j, j i} = area of cell for v i in Voronoi diagram on the points of P, D(x) := V P (x) = {y Ω : y x < y v i, i} = area of cell for x in Voronoi diagram on the points of P. By a slight abuse of notation, we also define The Sibson coordinates are defined to be λ Sibs i (x) := D(x) C i D(x) D(x) C i := V P (x) V P (v i ). or, equivalently, λ Sibs i (x) = D(x) C i n j= D. j(x) C j omputational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences24 University / 29
25 Optimal Coordinates Let g i : Ω R be the piecewise linear function satisfying g i (v j ) = δ ij, g i linear on each edge of Ω. The optimal coordinate function λ Opt i equations with g i as boundary data, { ( λ Opt i is defined to be the solution of Laplace s ) = 0, on Ω, λ Opt i = g i. on Ω. These coordinates are optimal in the sense that they minimize the norm of the gradient over all functions satisfying the boundary conditions, { } λ Opt i = argmin λ H (Ω) : λ = g i on Ω. (3) Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences25 University / 29
26 Polyhedral H(Curl) Vector Interpolantion Let {λ i } denote a set of generalized barycentric coordinates for a polygon (2D) or polyhedra (3D). Define for each edge v i v j :: Theorem [G,Bajaj] η ij := λ i λ j λ j λ i Constructing Whitney-like -forms analogously to the triangular case produces globally H(curl )-conforming vector fields. v k PROOF: Consider edge v i v j and λ k associated to a different vertex v k. Then the edge is part of the zero level set of λ k. Hence λ k must be perpendicular to the edge at all points along it and any summand λ l λ k has no tangential component on the edge. Therefore, the tangential components only depend on λ i and λ j. Hence the H(curl ) conformity constraints are satisfied. To decide which definition of {λ i } is suitable, we need error estimates. Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences26 University / 29
27 Error Estimates: 2D Scalar Case The optimal convergence estimate for a finite element method bounds the interpolation error in H -norm of an unknown function u by a constant multiple of the mesh size times the H 2 semi-norm of u: u I 0 u H (Ω) C diam(ω) u H 2 (Ω), u H2 (Ω). (4) (Note that I 0 u assumes u is known or computed at vertices of the dual mesh.) Theorem [G, Rand, Bajaj] Assume certain standard geometric quality conditions on the dual mesh can be guaranteed. Then a dual formulation of a finite element method using any of the coordinate systems has the optimal convergence estimate on the mesh. Error Estimates for Generalized Barycentric Interpolation. Submitted, 200. Example showing necessity of geometric criteria for Wachspress coordinates. Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences27 University / 29
28 Future Work Efficient computation of λ i basis functions Error estimates for polyhedral vector functions H(div )-conforming vector elements for polyhedral meshes Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences28 University / 29
29 Questions? Thank you for inviting me to visit. Slides and pre-prints available at Computational Visualization Center, I C E S (Department The University of Mathematics of TexasInstitute at Austinof Computational Engineering LANL - Jand 20 Sciences29 University / 29
Dual Interpolants for Finite Element Methods
Dual Interpolants for Finite Element Methods Andrew Gillette joint work with Chandrajit Bajaj and Alexander Rand Department of Mathematics Institute of Computational Engineering and Sciences University
More informationH(curl) and H(div) Elements on Polytopes from Generalized Barycentric Coordinates
H(curl) and H(div) Elements on Polytopes from Generalized Barycentric Coordinates Andrew Gillette Department of Mathematics University of Arizona joint work with Alex Rand (CD-adapco) Chandrajit Bajaj
More informationA Generalization for Stable Mixed Finite Elements
A Generalization for Stable Mixed Finite Elements Andrew Gillette Department of Mathematics University of Texas at Austin agillette@math.utexas.edu Chandrajit Bajaj Department of Computer Sciences University
More informationPolygonal, Polyhedral, and Serendipity Finite Element Methods
Polygonal, Polyhedral, and Serendipity Finite Element Methods Andrew Gillette Department of Mathematics University of Arizona ASU Computational and Applied Math Seminar Slides and more info at: http://math.arizona.edu/
More informationDiscrete Exterior Calculus
Discrete Exterior Calculus Peter Schröder with Mathieu Desbrun and the rest of the DEC crew 1 Big Picture Deriving a whole Discrete Calculus first: discrete domain notion of chains and discrete representation
More informationDiscrete Exterior Calculus How to Turn Your Mesh into a Computational Structure. Discrete Differential Geometry
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
More informationCS 468 (Spring 2013) Discrete Differential Geometry
CS 468 (Spring 2013) Discrete Differential Geometry 1 Math Review Lecture 14 15 May 2013 Discrete Exterior Calculus Lecturer: Justin Solomon Scribe: Cassidy Saenz Before we dive into Discrete Exterior
More informationNodal Basis Functions for Serendipity Finite Elements
Nodal Basis Functions for Serendipity Finite Elements Andrew Gillette Department of Mathematics University of Arizona joint work with Michael Floater (University of Oslo) Andrew Gillette - U. Arizona Nodal
More informationA Primer on Laplacians. Max Wardetzky. Institute for Numerical and Applied Mathematics Georg-August Universität Göttingen, Germany
A Primer on Laplacians Max Wardetzky Institute for Numerical and Applied Mathematics Georg-August Universität Göttingen, Germany Warm-up: Euclidean case Warm-up The Euclidean case Chladni s vibrating plates
More informationModern Directions in Finite Element Theory: Polytope Meshes and Serendipity Methods
Modern Directions in Finite Element Theory: Polytope Meshes and Serendipity Methods Andrew Gillette Department of Mathematics University of Arizona Andrew Gillette - U. Arizona Polytope ( ) and Serendipity
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationGeneralized barycentric coordinates
Generalized barycentric coordinates Michael S. Floater August 20, 2012 In this lecture, we review the definitions and properties of barycentric coordinates on triangles, and study generalizations to convex,
More informationPyDEC: Software and Algorithms for Discretization of Exterior Calculus
PyDEC: Software and Algorithms for Discretization of Exterior Calculus Nathan Bell 1 and Anil N. Hirani 2 1 NVIDIA Corporation, nbell@nvidia.com 2 Department of Computer Science, University of Illinois
More informationBarycentric Finite Element Methods
University of California, Davis Barycentric Finite Element Methods N. Sukumar University of California at Davis SIAM Conference on Geometric Design and Computing November 8, 2007 Collaborators and Acknowledgements
More informationDiscrete Poincaré lemma
Applied Numerical Mathematics 53 (2005) 231 248 www.elsevier.com/locate/apnum Discrete Poincaré lemma Mathieu Desbrun a, Melvin Leok b,, Jerrold E. Marsden c a 256-80, Department of Computer Science, Caltech,
More informationFinite Element Methods
Chapter 5 Finite Element Methods 5.1 Finite Element Spaces Remark 5.1 Mesh cells, faces, edges, vertices. A mesh cell is a compact polyhedron in R d, d {2,3}, whose interior is not empty. The boundary
More informationSurface Parameterization
Surface Parameterization A Tutorial and Survey Michael Floater and Kai Hormann Presented by Afra Zomorodian CS 468 10/19/5 1 Problem 1-1 mapping from domain to surface Original application: Texture mapping
More informationTopological Issues in Hexahedral Meshing
Topological Issues in Hexahedral Meshing David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science Outline I. What is meshing? Problem statement Types of mesh Quality issues
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More informationDiamonds: Finite Element/Discrete Mechanics schemes with guaranteed optimal convergence
Diamonds: Finite Element/Discrete Mechanics schemes with guaranteed optimal convergence M. Ortiz California Institute of Technology In collaboration with: P. Hauret and E. Kuhl International Conference
More informationCS Fall Homework 3: Vector Field Decomposition Due November 18th before midnight Please send your pdf and code to
CS 177 - Fall 2010 Homework 3: Vector Field Decomposition Due November 18th before midnight Please send your pdf and code to fferrari@caltech.edu 1 Differential Forms 1.1 Vectors and Covectors You re probably
More informationBarycentric Finite Element Methods
University of California, Davis Barycentric Finite Element Methods N. Sukumar UC Davis Workshop on Generalized Barycentric Coordinates, Columbia University July 26, 2012 Collaborators and Acknowledgements
More informationAn Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems
An Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems Long Chen University of California, Irvine chenlong@math.uci.edu Joint work with: Huayi Wei (Xiangtan University),
More informationVoroCrust: Simultaneous Surface Reconstruction and Volume Meshing with Voronoi cells
VoroCrust: Simultaneous Surface Reconstruction and Volume Meshing with Voronoi cells Scott A. Mitchell (speaker), joint work with Ahmed H. Mahmoud, Ahmad A. Rushdi, Scott A. Mitchell, Ahmad Abdelkader
More informationPolygonal Finite Elements for Finite Elasticity
Polygonal Finite Elements for Finite Elasticity Heng Chi a, Cameron Talischi b, Oscar Lopez-Pamies b, Glaucio H. Paulino a a: Georgia Institute of Technology b: University of Illinois at Urbana-Champaign
More informationSurfaces, meshes, and topology
Surfaces from Point Samples Surfaces, meshes, and topology A surface is a 2-manifold embedded in 3- dimensional Euclidean space Such surfaces are often approximated by triangle meshes 2 1 Triangle mesh
More informationNonoscillatory Central Schemes on Unstructured Triangular Grids for Hyperbolic Systems of Conservation Laws
Nonoscillatory Central Schemes on Unstructured Triangular Grids for Hyperbolic Systems of Conservation Laws Ivan Christov 1,* Bojan Popov 1 Peter Popov 2 1 Department of Mathematics, 2 Institute for Scientific
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationHigh Order Nédélec Elements with local complete sequence properties
High Order Nédélec Elements with local complete sequence properties Joachim Schöberl and Sabine Zaglmayr Institute for Computational Mathematics, Johannes Kepler University Linz, Austria E-mail: {js,sz}@jku.at
More informationTHE MORTAR FINITE ELEMENT METHOD IN 2D: IMPLEMENTATION IN MATLAB
THE MORTAR FINITE ELEMENT METHOD IN D: IMPLEMENTATION IN MATLAB J. Daněk, H. Kutáková Department of Mathematics, University of West Bohemia, Pilsen MECAS ESI s.r.o., Pilsen Abstract The paper is focused
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationACTUALLY DOING IT : an Introduction to Polyhedral Computation
ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2
More informationNonoscillatory Central Schemes on Unstructured Triangulations for Hyperbolic Systems of Conservation Laws
Nonoscillatory Central Schemes on Unstructured Triangulations for Hyperbolic Systems of Conservation Laws Ivan Christov Bojan Popov Department of Mathematics, Texas A&M University, College Station, Texas
More informationarxiv: v2 [math.na] 2 Oct 2015
INTERPOLATION ERROR ESTIMATES FOR HARMONIC COORDINATES ON POLYTOPES ANDREW GILLETTE AND ALEXANDER RAND arxiv:1504.00599v2 [math.na] 2 Oct 2015 Abstract. Interpolation error estimates in terms of geometric
More informationScientific Computing WS 2018/2019. Lecture 12. Jürgen Fuhrmann Lecture 12 Slide 1
Scientific Computing WS 2018/2019 Lecture 12 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 12 Slide 1 Recap For more discussion of mesh generation, see J.R. Shewchuk: Lecture Notes on Delaunay
More informationA Data Dependent Triangulation for Vector Fields
A Data Dependent Triangulation for Vector Fields Gerik Scheuermann Hans Hagen Institut for Computer Graphics and CAGD Department of Computer Science University of Kaiserslautern, Postfach 3049, D-67653
More informationAs a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9.
II.4 Surface Simplification 37 II.4 Surface Simplification In applications it is often necessary to simplify the data or its representation. One reason is measurement noise, which we would like to eliminate,
More informationOne-to-One Piecewise Linear Mappings Over Triangulations
One-to-One Piecewise Linear Mappings Over Triangulations Michael S. Floater Presentation by Elif Tosun Geometric Modeling Fall 02 Outline Introduction Triangulations Convex Combination Mappings Proof:
More informationLecture 5: Duality Theory
Lecture 5: Duality Theory Rajat Mittal IIT Kanpur The objective of this lecture note will be to learn duality theory of linear programming. We are planning to answer following questions. What are hyperplane
More informationConvexity: an introduction
Convexity: an introduction Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 74 1. Introduction 1. Introduction what is convexity where does it arise main concepts and
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationPoint-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS
Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationA new 8-node quadrilateral spline finite element
Journal of Computational and Applied Mathematics 195 (2006) 54 65 www.elsevier.com/locate/cam A new 8-node quadrilateral spline finite element Chong-Jun Li, Ren-Hong Wang Institute of Mathematical Sciences,
More informationApproximating Polygonal Objects by Deformable Smooth Surfaces
Approximating Polygonal Objects by Deformable Smooth Surfaces Ho-lun Cheng and Tony Tan School of Computing, National University of Singapore hcheng,tantony@comp.nus.edu.sg Abstract. We propose a method
More informationDiscrete Differential Geometry. Differential Geometry
Discrete Differential Geometry Yiying Tong CSE 891 Sect 004 Differential Geometry Why do we care? theory: special surfaces minimal, CMC, integrable, etc. computation: simulation/processing Grape (u. of
More informationCLASSIFICATION OF SURFACES
CLASSIFICATION OF SURFACES JUSTIN HUANG Abstract. We will classify compact, connected surfaces into three classes: the sphere, the connected sum of tori, and the connected sum of projective planes. Contents
More informationDiscrete Surfaces. David Gu. Tsinghua University. Tsinghua University. 1 Mathematics Science Center
Discrete Surfaces 1 1 Mathematics Science Center Tsinghua University Tsinghua University Discrete Surface Discrete Surfaces Acquired using 3D scanner. Discrete Surfaces Our group has developed high speed
More informationQuadratic and cubic b-splines by generalizing higher-order voronoi diagrams
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams Yuanxin Liu and Jack Snoeyink Joshua Levine April 18, 2007 Computer Science and Engineering, The Ohio State University 1 / 24
More informationLARGE SCALE LINEAR AND INTEGER OPTIMIZATION: A UNIFIED APPROACH
LARGE SCALE LINEAR AND INTEGER OPTIMIZATION: A UNIFIED APPROACH Richard Kipp Martin Graduate School of Business University of Chicago % Kluwer Academic Publishers Boston/Dordrecht/London CONTENTS Preface
More informationBenchmark 3D: the VAG scheme
Benchmark D: the VAG scheme Robert Eymard, Cindy Guichard and Raphaèle Herbin Presentation of the scheme Let Ω be a bounded open domain of R, let f L 2 Ω) and let Λ be a measurable function from Ω to the
More informationLecture 2. Topology of Sets in R n. August 27, 2008
Lecture 2 Topology of Sets in R n August 27, 2008 Outline Vectors, Matrices, Norms, Convergence Open and Closed Sets Special Sets: Subspace, Affine Set, Cone, Convex Set Special Convex Sets: Hyperplane,
More informationEuler s Theorem. Brett Chenoweth. February 26, 2013
Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s
More informationParameterization of Meshes
2-Manifold Parameterization of Meshes What makes for a smooth manifold? locally looks like Euclidian space collection of charts mutually compatible on their overlaps form an atlas Parameterizations are
More informationThe basics of rigidity
The basics of rigidity Lectures I and II Session on Granular Matter Institut Henri Poincaré R. Connelly Cornell University Department of Mathematics 1 What determines rigidity? 2 What determines rigidity?
More informationMA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:
MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of
More informationNon-Linear Finite Element Methods in Solid Mechanics Attilio Frangi, Politecnico di Milano, February 3, 2017, Lesson 1
Non-Linear Finite Element Methods in Solid Mechanics Attilio Frangi, attilio.frangi@polimi.it Politecnico di Milano, February 3, 2017, Lesson 1 1 Politecnico di Milano, February 3, 2017, Lesson 1 2 Outline
More informationSIMPLICIAL ENERGY AND SIMPLICIAL HARMONIC MAPS
SIMPLICIAL ENERGY AND SIMPLICIAL HARMONIC MAPS JOEL HASS AND PETER SCOTT Abstract. We introduce a combinatorial energy for maps of triangulated surfaces with simplicial metrics and analyze the existence
More informationAMS : Combinatorial Optimization Homework Problems - Week V
AMS 553.766: Combinatorial Optimization Homework Problems - Week V For the following problems, A R m n will be m n matrices, and b R m. An affine subspace is the set of solutions to a a system of linear
More informationGeneralized Barycentric Coordinates
Generalized Barycentric Coordinates Kai Hormann Faculty of Informatics University of Lugano Cartesian coordinates y 3 2 ( 3,1) 1 3 2 1 1 2 3 (2,2) (0,0) 1 2 3 (1, 2) x René Descartes (1596 1650) Appendix
More informationarxiv: v1 [math.na] 20 Sep 2016
arxiv:1609.06236v1 [math.na] 20 Sep 2016 A Local Mesh Modification Strategy for Interface Problems with Application to Shape and Topology Optimization P. Gangl 1,2 and U. Langer 3 1 Doctoral Program Comp.
More informationarxiv: v4 [cs.na] 6 Sep 2011
Least Squares Ranking on Graphs Anil N. Hirani 1, Kaushik Kalyanaraman 1, and Seth Watts 2 1 Department of Computer Science, University of Illinois at Urbana-Champaign 2 Department of Mech. Sci. & Eng.,
More information11 Linear Programming
11 Linear Programming 11.1 Definition and Importance The final topic in this course is Linear Programming. We say that a problem is an instance of linear programming when it can be effectively expressed
More informationConvex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Menelaos I. Karavelas joint work with Eleni Tzanaki University of Crete & FO.R.T.H. OrbiCG/ Workshop on Computational
More informationDISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU /858B Fall 2017
DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU 15-458/858B Fall 2017 LECTURE 2: THE SIMPLICIAL COMPLEX DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU
More informationLecture 0: Reivew of some basic material
Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms
More informationLinear programming and duality theory
Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables
More informationInvariant shape similarity. Invariant shape similarity. Invariant similarity. Equivalence. Equivalence. Equivalence. Equal SIMILARITY TRANSFORMATION
1 Invariant shape similarity Alexer & Michael Bronstein, 2006-2009 Michael Bronstein, 2010 tosca.cs.technion.ac.il/book 2 Invariant shape similarity 048921 Advanced topics in vision Processing Analysis
More informationConic Duality. yyye
Conic Linear Optimization and Appl. MS&E314 Lecture Note #02 1 Conic Duality Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationAnisotropic quality measures and adaptation for polygonal meshes
Anisotropic quality measures and adaptation for polygonal meshes Yanqiu Wang, Oklahoma State University joint work with Weizhang Huang Oct 2015, POEMs, Georgia Tech. 1 / 23 Consider the following function
More informationOutline of the presentation
Surface Reconstruction Petra Surynková Charles University in Prague Faculty of Mathematics and Physics petra.surynkova@mff.cuni.cz Outline of the presentation My work up to now Surfaces of Building Practice
More informationLecture notes for Topology MMA100
Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine
More informationPROPERTIES OF NATURAL ELEMENT COORDINATES ON ANY POLYHEDRON
PROPRTIS OF NATURAL LMNT COORDINATS ON ANY POLYHDRON P. Milbradt and T. Fröbel Institute of Computer Science in Civil ngineering, Univercity of Hanover, 3067, Hanover, Germany; PH (+49) 5-76-5757; FAX
More informationLectures in Discrete Differential Geometry 3 Discrete Surfaces
Lectures in Discrete Differential Geometry 3 Discrete Surfaces Etienne Vouga March 19, 2014 1 Triangle Meshes We will now study discrete surfaces and build up a parallel theory of curvature that mimics
More informationTopological Rewriting & Patch Transformations
Topological Rewriting & Patch Transformations Antoine Spicher www.spatial-computing.org/mgs SUPMECA June 2015 Outline MGS: a Formal Introduction Patch Transformations Differential Operators An Integrative
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationMulti-tiling and equidecomposability of polytopes by lattice translates
Multi-tiling and equidecomposability of polytopes by lattice translates Bochen Liu Bar-Ilan University, Israel Joint work with Nir Lev 1 / 19 Multi-tiling Let A R d be a polytope and denote χ A as its
More informationCOMPUTATIONAL GEOMETRY
Thursday, September 20, 2007 (Ming C. Lin) Review on Computational Geometry & Collision Detection for Convex Polytopes COMPUTATIONAL GEOMETRY (Refer to O'Rourke's and Dutch textbook ) 1. Extreme Points
More informationVoronoi Diagram. Xiao-Ming Fu
Voronoi Diagram Xiao-Ming Fu Outlines Introduction Post Office Problem Voronoi Diagram Duality: Delaunay triangulation Centroidal Voronoi tessellations (CVT) Definition Applications Algorithms Outlines
More informationSurfaces: notes on Geometry & Topology
Surfaces: notes on Geometry & Topology 1 Surfaces A 2-dimensional region of 3D space A portion of space having length and breadth but no thickness 2 Defining Surfaces Analytically... Parametric surfaces
More informationWESTFÄLISCHE WILHELMS-UNIVERSITÄT MÜNSTER
MÜNSTER Adaptive Discretization of Liftings for Curvature Regularization SIAM Conference on Imaging Science 2016, Albuquerque, NM Ulrich Hartleif, Prof. Dr. Benedikt Wirth May 23, 2016 Outline MÜNSTER
More informationConvexity Theory and Gradient Methods
Convexity Theory and Gradient Methods Angelia Nedić angelia@illinois.edu ISE Department and Coordinated Science Laboratory University of Illinois at Urbana-Champaign Outline Convex Functions Optimality
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationOPTIMIZATION METHODS
D. Nagesh Kumar Associate Professor Department of Civil Engineering, Indian Institute of Science, Bangalore - 50 0 Email : nagesh@civil.iisc.ernet.in URL: http://www.civil.iisc.ernet.in/~nagesh Brief Contents
More informationArea of Lattice Point Polygons. Andrejs Treibergs. Wednesday, January 16, 2019
Undergraduate Colloquium: Area of Lattice Point Polygons Andrejs Treibergs University of Utah Wednesday, January 16, 2019 2. Undergraduate Colloquium Lecture on Area of Lattice Point Polygons The URL for
More informationMinimization algorithm in the simulation of the Wall Touching Kink Modes
arxiv:1712.01750v1 [physics.plasm-ph] 5 Dec 2017 Minimization algorithm in the simulation of the Wall Touching Kink Modes G. Steinbrecher, N. Pometescu Department of Physics, University of Craiova, Str.
More informationConvex Optimization MLSS 2015
Convex Optimization MLSS 2015 Constantine Caramanis The University of Texas at Austin The Optimization Problem minimize : f (x) subject to : x X. The Optimization Problem minimize : f (x) subject to :
More informationChapter 3 Numerical Methods
Chapter 3 Numerical Methods Part 1 3.1 Linearization and Optimization of Functions of Vectors 1 Problem Notation 2 Outline 3.1.1 Linearization 3.1.2 Optimization of Objective Functions 3.1.3 Constrained
More informationSensors & Transducers 2016 by IFSA Publishing, S. L.
Sensors & Transducers, Vol. 98, Issue 3, March 206, pp. 55-60 Sensors & Transducers 206 by IFSA Publishing, S. L. http://www.sensorsportal.com The Constrained Natural Element Method Applied in Electromagnetic
More informationA Hybrid Magnetic Field Solver Using a Combined Finite Element/Boundary Element Field Solver
A Hybrid Magnetic Field Solver Using a Combined Finite Element/Boundary Element Field Solver Abstract - The dominant method to solve magnetic field problems is the finite element method. It has been used
More informationVoronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text
Voronoi Diagrams in the Plane Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams As important as convex hulls Captures the neighborhood (proximity) information of geometric objects
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics SIMPLIFYING TRIANGULATIONS OF S 3 Aleksandar Mijatović Volume 208 No. 2 February 2003 PACIFIC JOURNAL OF MATHEMATICS Vol. 208, No. 2, 2003 SIMPLIFYING TRIANGULATIONS OF S
More informationSimplicial Complexes: Second Lecture
Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,
More informationmaximize c, x subject to Ax b,
Lecture 8 Linear programming is about problems of the form maximize c, x subject to Ax b, where A R m n, x R n, c R n, and b R m, and the inequality sign means inequality in each row. The feasible set
More informationProgramming, numerics and optimization
Programming, numerics and optimization Lecture C-4: Constrained optimization Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 June
More informationSubmodularity Reading Group. Matroid Polytopes, Polymatroid. M. Pawan Kumar
Submodularity Reading Group Matroid Polytopes, Polymatroid M. Pawan Kumar http://www.robots.ox.ac.uk/~oval/ Outline Linear Programming Matroid Polytopes Polymatroid Polyhedron Ax b A : m x n matrix b:
More informationOn a nested refinement of anisotropic tetrahedral grids under Hessian metrics
On a nested refinement of anisotropic tetrahedral grids under Hessian metrics Shangyou Zhang Abstract Anisotropic grids, having drastically different grid sizes in different directions, are efficient and
More informationFACES OF CONVEX SETS
FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.
More informationMöbius Transformations in Scientific Computing. David Eppstein
Möbius Transformations in Scientific Computing David Eppstein Univ. of California, Irvine School of Information and Computer Science (including joint work with Marshall Bern from WADS 01 and SODA 03) Outline
More information