DOCSLIB.ORG

Discrete Differential Geometry: an Applied Introduction

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Discrete Differential Geometry: an Applied Introduction Discrete Differential Geometry: An Applied Introduction SIGGRAPH 2006 LECTURERS COURSE NOTES Mathieu Desbrun Konrad Polthier ORGANIZER Peter Schröder Eitan Grinspun Ari Stern Preface The behavior of physical systems is typically described by a set of continuous equations using tools such as geometric mechanics and differential geometry to analyze and capture their properties. For purposes of computation one must derive discrete (in space and time) representations of the underlying equations. Researchers in a variety of areas have discovered that theories, which are discrete from the start, and have key geometric properties built into their discrete description can often more readily yield robust numerical simulations which are true to the underlying continuous systems: they exactly preserve invariants of the continuous systems in the discrete computational realm. This volume documents the full day course Discrete Differential Ge- ometry: An Applied Introduction at SIGGRAPH ’06 on 30 July 2006. These notes supplement the lectures given by Mathieu Des- brun, Eitan Grinspun, Konrad Polthier, Peter Schroder,¨ and Ari Stern. These notes include contributions by Miklos Bergou, Alexan- der I. Bobenko, Sharif Elcott, Matthew Fisher, David Harmon, Eva Kanso, Markus Schmies, Adrian Secord, Boris Springborn, Ari Stern, John M. Sullivan, Yiying Tong, Max Wardetzky, and Denis Zorin, and build on the ideas of many others. A chapter-by-chapter synopsis The course notes are organized similarly to the lectures. We in- troduce discrete differential geometry in the context of discrete curves and curvature (Chapter 1). The overarching themes intro- duced here, convergence and structure preservation, make repeated appearances throughout the entire volume. We ask the question of which quantities one should measure on a discrete object such as a triangle mesh, and how one should define such measurements (Chapter 2). This exploration yields a host of measurements such as length, area, mean curvature, etc., and these in turn form the basis for various applications described later on. We conclude the intro- duction with a summary of curvature measures for discrete surfaces (Chapter 3). The discussion of immersed surfaces paves the way for a discrete treatment of thin-shell mechanics (Chapter 4), and more generally of isometric curvature energies, with applications to fast cloth sim- ulation and Willmore flow (Chapter 5). Continuing with the theme of discrete surfaces, we define straightest geodesics on polyhedral surfaces with applications to integration of vector fields (Chapter 6). At this point we shift down to explore the low-level approach of discrete exterior calculus: after an overview of the field (Chapter 7), we lay out the simple tools for implementing DEC (Chapter 8). With this in place, numerically robust and efficient simulations of the Navier-Stokes equations of fluids become possible (Chapter 9). Simulations of thin-shells, cloth, and fluids, and geometric mod- eling problems such as fairing and parametrization, require robust numerical treatment in both space and time: we describe the in- trinsic Laplace-Beltrami operator, which satisfies a local maximum principle and leads to better conditioned linear systems (Chapter 10), and we overview the variational time integrators offered by the geometric mechanics paradigm (Chapter 11). Eitan Grinspun with Mathieu Desbrun, Konrad Polthier, and Peter Schroder¨ 11 May 2006 i Contents Chapter 1: Introduction to Discrete Differential Geometry: The Geometry of Plane Curves ........................1 Eitan Grinspun and Adrian Secord Chapter 2: What can we measure?...............................................................................................................5 Peter Schröder Chapter 3: Curvature measures for discrete surfaces.................................................................................. 10 John M . Sullivan Chapter 4: A discrete model for thin shells................................................................................................ 14 Eitan Grinspun Chapter 5: Discrete Quadratic Curvature Energies..................................................................................... 20 Miklos Bergou, Max Wardetzky, David Harmon, Denis Zorin, and Eitan Grinspun Chapter 6: Straightest Geodesics on Polyhedral Surface............................................................................ 30 Konrad Polthier and Markus Schmies Chapter 7: Discrete Differential Forms for Computational Modeling......................................................... 39 Mathieu Desbrun, Eva Kanso, and Yiying Tong Chapter 8: Building Your Own DEC at Home........................................................................................... 55 Sharif Elcott and Peter Schröder Chapter 9: Stable, Circulation-Preserving, Simplicial Fluids ..................................................................... 60 Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, and Mathieu Desbrun Chapter 10: An Algorithm for the Construction of Intrinsic Delaunay Triangulations with Applications to Digital Geometry Processing .................................................................................... 69 Matthew Fisher, Boris Springborn, Alexander I. Bobenko, Peter Schröder Chapter 11: Discrete Geometric Mechanics for Variational Time Integrators ............................................ 75 Ari Stern and Mathieu Desbrun ii Discrete Differential Geometry: An Applied Introduction SIGGRAPH 2006 Chapter 1: Introduction to Discrete Differential Geometry: The Geometry of Plane Curves Eitan Grinspun Adrian Secord Columbia University New York University 1 Introduction The nascent field of discrete differential geometry deals with discrete geometric objects (such as polygons) which act as analogues to continuous geometric objects (such as curves). The discrete objects can be measured (length, area) and can interact with other discrete objects (collision/response). From a computational standpoint, the discrete objects are attractive, because they have been designed from the ground up with data-structures and algorithms in mind. From a mathematical standpoint, they present a great challenge: the discrete objects should have properties which are ana- logues of the properties of continuous objects. One impor- P tant property of curves and surfaces is their curvature, which plays a significant role in many application areas (see, e.g., Chapters 4 and 5). In the continuous domain there are re- Figure 1: The family of tangent circles to the curve at point markable theorems dealing with curvature; a key require- P . The circle of curvature is the only one crossing the curve ment for a discrete curve with discrete curvature is that it at P . satisfies analogous theorems. In this chapter we examine the curvature of continuous and discrete curves on the plane. The notes in this chapter draw from a lecture given by P . If the curve is sufficiently smooth (“curvature-continuous John Sullivan in May 2004 at Oberwolfach, and from the at P ”) then the circle thus approaches a definite position writings of David Hilbert in his book Geometry and the known as the circle of curvature or osculating circle; the Imagination. center and radius of the osculating circle are the center of curvature and radius of curvature associated to point P on the curve. The inverse of the radius is κ, the curvature of 2 Geometry of the Plane Curve the curve at P . Consider a plane curve, in particular a small piece If we also consider a sense of traversal along the curve of curve which does not cross itself (a simple curve). segment (think of adding an arrowhead at one end of the Choose two points, P and Q, segment) then we may measure the signed curvature, iden- on this curve and connect them tical in magnitude to the curvature, but negative in sign P with a straight line: a secant. whenever the curve is turning clockwise (think of riding a Fixing P as the “hinge,” ro- bicycle along the curve: when we turn to the right, it is tate the secant about P so because the center of curvature lies to the right, and the Q that Q slides along the curve curvature is negative). toward Q. If the curve is Another way to define the circle of curvature is by con- sufficiently smooth (“tangent- sidering the infinite family of circles which are tangent to continuous at P ”) then the se- the curve at P (see Figure 1). Every point on the normal cant approaches a definite line: the tangent. Of all the to the curve at P serves as the center for one circle in this straight lines passing through P , the tangent is the best family. In a small neighborhood around P the curve divides approximation to the curve. Consequently we define the di- the plane into two sides. Every circle (but one!) in our fam- rection of the curve at P to be the direction of the tangent, ily lies entirely in one side or the other. Only the circle of so that if two curves intersect at a point P their angle of curvature however spans both sides, crossing the curve at P . intersection is given by the angle formed by their tangents It divides the family of tangent circles into two sets: those at P . If both curves have identical tangents at P then we with radius smaller than the radius of curvature lying on one say “the curves are tangent at P .” Returning to our sin- side, and those with greater radius lying on the other side. gle curve, the line perpendicular to the tangent and passing There may exist special points on the curve at which the through P is called the normal to the curve at P . Together
Load more

Recommended publications
  • Geometric Representations of Graphs
    1 Geometric Representations of Graphs Laszl¶ o¶ Lovasz¶ Microsoft Research One Microsoft Way, Redmond, WA 98052 e-mail: [email protected] 2 Contents I Background 5 1 Eigenvalues of graphs 7 1.1 Matrices associated with graphs ............................ 7 1.2 The largest eigenvalue ................................. 8 1.2.1 Adjacency matrix ............................... 8 1.2.2 Laplacian .................................... 9 1.2.3 Transition matrix ................................ 9 1.3 The smallest eigenvalue ................................ 9 1.4 The eigenvalue gap ................................... 11 1.4.1 Expanders .................................... 12 1.4.2 Random walks ................................. 12 1.5 The number of di®erent eigenvalues .......................... 17 1.6 Eigenvectors ....................................... 19 2 Convex polytopes 21 2.1 Polytopes and polyhedra ................................ 21 2.2 The skeleton of a polytope ............................... 21 2.3 Polar, blocker and antiblocker ............................. 22 II Representations of Planar Graphs 25 3 Planar graphs and polytopes 27 3.1 Planar graphs ...................................... 27 3.2 Straight line representation and 3-polytopes ..................... 28 4 Rubber bands, cables, bars and struts 29 4.1 Rubber band representation .............................. 29 4.1.1 How to draw a graph? ............................. 30 4.1.2 How to lift a graph? .............................. 32 4.1.3 Rubber bands and connectivity .......................
    [Show full text]
  • Digital and Discrete Geometry Li M
    Digital and Discrete Geometry Li M. Chen Digital and Discrete Geometry Theory and Algorithms 2123 Li M. Chen University of the District of Columbia Washington District of Columbia USA ISBN 978-3-319-12098-0 ISBN 978-3-319-12099-7 (eBook) DOI 10.1007/978-3-319-12099-7 Springer Cham Heidelberg New York Dordrecht London Library of Congress Control Number: 2014958741 © Springer International Publishing Switzerland 2014 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) To the researchers and their supporters in Digital Geometry and Topology.
    [Show full text]
  • Discrete Calculus with Cubic Cells on Discrete Manifolds 3
    DISCRETE CALCULUS WITH CUBIC CELLS ON DISCRETE MANIFOLDS LEONARDO DE CARLO Abstract. This work is thought as an operative guide to ”discrete exterior calculus” (DEC), but at the same time with a rigorous exposition. We present a version of (DEC) on ”cubic” cell, defining it for discrete manifolds. An example of how it works, it is done on the discrete torus, where usual Gauss and Stokes theorems are recovered. Keywords: Discrete Calculus, discrete differential geometry AMS 2010 Subject Classification: 97N70 1. Introduction Discrete exterior calculus (DEC) is motivated by potential applications in com- putational methods for field theories (elasticity, fluids, electromagnetism) and in areas of computer vision/graphics, for these applications see for example [DDT15], [DMTS14] or [BSSZ08]. DEC is developing as an alternative approach for com- putational science to the usual discretizing process from the continuous theory. It considers the discrete mesh as the only thing given and develops an entire calcu- lus using only discrete combinatorial and geometric operations. The derivations may require that the objects on the discrete mesh, but not the mesh itself, are interpolated as if they come from a continuous model. Therefore DEC could have interesting applications in fields where there isn’t any continuous underlying struc- ture as Graph theory [GP10] or problems that are inherently discrete since they are defined on a lattice [AO05] and it can stand in its own right as theory that parallels the continuous one. The language of DEC is founded on the concept of discrete differential form, this characteristic allows to preserve in the discrete con- text some of the usual geometric and topological structures of continuous models, arXiv:1906.07054v2 [cs.DM] 8 Jul 2019 in particular the Stokes’theorem dω = ω.
    [Show full text]
  • High Order Gradient, Curl and Divergence Conforming Spaces, with an Application to NURBS-Based Isogeometric Analysis
    High order gradient, curl and divergence conforming spaces, with an application to compatible NURBS-based IsoGeometric Analysis R.R. Hiemstraa, R.H.M. Huijsmansa, M.I.Gerritsmab aDepartment of Marine Technology, Mekelweg 2, 2628CD Delft bDepartment of Aerospace Technology, Kluyverweg 2, 2629HT Delft Abstract Conservation laws, in for example, electromagnetism, solid and fluid mechanics, allow an exact discrete representation in terms of line, surface and volume integrals. We develop high order interpolants, from any basis that is a partition of unity, that satisfy these integral relations exactly, at cell level. The resulting gradient, curl and divergence conforming spaces have the propertythat the conservationlaws become completely independent of the basis functions. This means that the conservation laws are exactly satisfied even on curved meshes. As an example, we develop high ordergradient, curl and divergence conforming spaces from NURBS - non uniform rational B-splines - and thereby generalize the compatible spaces of B-splines developed in [1]. We give several examples of 2D Stokes flow calculations which result, amongst others, in a point wise divergence free velocity field. Keywords: Compatible numerical methods, Mixed methods, NURBS, IsoGeometric Analyis Be careful of the naive view that a physical law is a mathematical relation between previously defined quantities. The situation is, rather, that a certain mathematical structure represents a given physical structure. Burke [2] 1. Introduction In deriving mathematical models for physical theories, we frequently start with analysis on finite dimensional geometric objects, like a control volume and its bounding surfaces. We assign global, ’measurable’, quantities to these different geometric objects and set up balance statements.
    [Show full text]
  • Discrete Mechanics and Optimal Control: an Analysis ∗
    ESAIM: COCV 17 (2011) 322–352 ESAIM: Control, Optimisation and Calculus of Variations DOI: 10.1051/cocv/2010012 www.esaim-cocv.org DISCRETE MECHANICS AND OPTIMAL CONTROL: AN ANALYSIS ∗ Sina Ober-Blobaum¨ 1, Oliver Junge 2 and Jerrold E. Marsden3 Abstract. The optimal control of a mechanical system is of crucial importance in many application areas. Typical examples are the determination of a time-minimal path in vehicle dynamics, a minimal energy trajectory in space mission design, or optimal motion sequences in robotics and biomechanics. In most cases, some sort of discretization of the original, infinite-dimensional optimization problem has to be performed in order to make the problem amenable to computations. The approach proposed in this paper is to directly discretize the variational description of the system’s motion. The resulting optimization algorithm lets the discrete solution directly inherit characteristic structural properties Rapide Not from the continuous one like symmetries and integrals of the motion. We show that the DMOC (Discrete Mechanics and Optimal Control) approach is equivalent to a finite difference discretization of Hamilton’s equations by a symplectic partitioned Runge-Kutta scheme and employ this fact in order to give a proof of convergence. The numerical performance of DMOC and its relationship to other existing optimal control methods are investigated. Mathematics Subject Classification. 49M25, 49N99, 65K10. Received October 8, 2008. Revised September 17, 2009. Highlight Published online March 31, 2010. Introduction In order to solve optimal control problems for mechanical systems, this paper links two important areas of research: optimal control and variational mechanics. The motivation for combining these fields of investigation is twofold.
    [Show full text]
  • Eigenvalues of Graphs
    Eigenvalues of graphs L¶aszl¶oLov¶asz November 2007 Contents 1 Background from linear algebra 1 1.1 Basic facts about eigenvalues ............................. 1 1.2 Semide¯nite matrices .................................. 2 1.3 Cross product ...................................... 4 2 Eigenvalues of graphs 5 2.1 Matrices associated with graphs ............................ 5 2.2 The largest eigenvalue ................................. 6 2.2.1 Adjacency matrix ............................... 6 2.2.2 Laplacian .................................... 7 2.2.3 Transition matrix ................................ 7 2.3 The smallest eigenvalue ................................ 7 2.4 The eigenvalue gap ................................... 9 2.4.1 Expanders .................................... 10 2.4.2 Edge expansion (conductance) ........................ 10 2.4.3 Random walks ................................. 14 2.5 The number of di®erent eigenvalues .......................... 16 2.6 Spectra of graphs and optimization .......................... 18 Bibliography 19 1 Background from linear algebra 1.1 Basic facts about eigenvalues Let A be an n £ n real matrix. An eigenvector of A is a vector such that Ax is parallel to x; in other words, Ax = ¸x for some real or complex number ¸. This number ¸ is called the eigenvalue of A belonging to eigenvector v. Clearly ¸ is an eigenvalue i® the matrix A ¡ ¸I is singular, equivalently, i® det(A ¡ ¸I) = 0. This is an algebraic equation of degree n for ¸, and hence has n roots (with multiplicity). The trace of the square matrix A = (Aij ) is de¯ned as Xn tr(A) = Aii: i=1 1 The trace of A is the sum of the eigenvalues of A, each taken with the same multiplicity as it occurs among the roots of the equation det(A ¡ ¸I) = 0. If the matrix A is symmetric, then its eigenvalues and eigenvectors are particularly well behaved.
    [Show full text]
  • SEMIGROUP ALGEBRAS and DISCRETE GEOMETRY By
    S´eminaires & Congr`es 6, 2002, p. 43–127 SEMIGROUP ALGEBRAS AND DISCRETE GEOMETRY by Winfried Bruns & Joseph Gubeladze Abstract.— In these notes we study combinatorial and algebraic properties of affine semigroups and their algebras:(1) the existence of unimodular Hilbert triangulations and covers for normal affine semigroups, (2) the Cohen–Macaulay property and num- ber of generators of divisorial ideals over normal semigroup algebras, and (3) graded automorphisms, retractions and homomorphisms of polytopal semigroup algebras. Contents 1.Introduction .................................................... 43 2.Affineandpolytopalsemigroupalgebras ........................ 44 3.Coveringandnormality ........................................ 54 4.Divisoriallinearalgebra ........................................ 70 5.Fromvectorspacestopolytopalalgebras ...................... 88 Index ..............................................................123 References ........................................................125 1. Introduction These notes, composed for the Summer School on Toric Geometry at Grenoble, June/July 2000, contain a major part of the joint work of the authors. In Section 3 we study a problemthat clearly belongs to the area of discrete ge- ometry or, more precisely, to the combinatorics of finitely generated rational cones and their Hilbert bases. Our motivation in taking up this problem was the attempt 2000 Mathematics Subject Classification.—13C14, 13C20, 13F20, 14M25, 20M25, 52B20. Key words and phrases.—Affine semigroup, lattice polytope,
    [Show full text]
  • Discrete Differential Geometry: an Applied Introduction
    DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane Last updated: April 13, 2020 Contents Chapter 1. Introduction 3 1.1. Disclaimer 6 1.2. Copyright 6 1.3. Acknowledgements 6 Chapter 2. Combinatorial Surfaces 7 2.1. Abstract Simplicial Complex 8 2.2. Anatomy of a Simplicial Complex: Star, Closure, and Link 10 2.3. Simplicial Surfaces 14 2.4. Adjacency Matrices 16 2.5. Halfedge Mesh 17 2.6. Written Exercises 21 2.7. Coding Exercises 26 Chapter 3. A Quick and Dirty Introduction to Differential Geometry 28 3.1. The Geometry of Surfaces 28 3.2. Derivatives and Tangent Vectors 31 3.3. The Geometry of Curves 34 3.4. Curvature of Surfaces 37 3.5. Geometry in Coordinates 41 Chapter 4. A Quick and Dirty Introduction to Exterior Calculus 45 4.1. Exterior Algebra 46 4.2. Examples of Wedge and Star in Rn 52 4.3. Vectors and 1-Forms 54 4.4. Differential Forms and the Wedge Product 58 4.5. Hodge Duality 62 4.6. Differential Operators 67 4.7. Integration and Stokes’ Theorem 73 4.8. Discrete Exterior Calculus 77 Chapter 5. Curvature of Discrete Surfaces 84 5.1. Vector Area 84 5.2. Area Gradient 87 5.3. Volume Gradient 89 5.4. Other Definitions 91 5.5. Gauss-Bonnet 94 5.6. Numerical Tests and Convergence 95 Chapter 6. The Laplacian 100 6.1. Basic Properties 100 6.2. Discretization via FEM 103 6.3. Discretization via DEC 107 1 CONTENTS 2 6.4. Meshes and Matrices 110 6.5. The Poisson Equation 112 6.6.
    [Show full text]
  • Discrete Differential Geometry
    Oberwolfach Seminars Volume 38 Discrete Differential Geometry Alexander I. Bobenko Peter Schröder John M. Sullivan Günter M. Ziegler Editors Birkhäuser Basel · Boston · Berlin Alexander I. Bobenko John M. Sullivan Institut für Mathematik, MA 8-3 Institut für Mathematik, MA 3-2 Technische Universität Berlin Technische Universität Berlin Strasse des 17. Juni 136 Strasse des 17. Juni 136 10623 Berlin, Germany 10623 Berlin, Germany e-mail: [email protected] e-mail: [email protected] Peter Schröder Günter M. Ziegler Department of Computer Science Institut für Mathematik, MA 6-2 Caltech, MS 256-80 Technische Universität Berlin 1200 E. California Blvd. Strasse des 17. Juni 136 Pasadena, CA 91125, USA 10623 Berlin, Germany e-mail: [email protected] e-mail: [email protected] 2000 Mathematics Subject Classification: 53-02 (primary); 52-02, 53-06, 52-06 Library of Congress Control Number: 2007941037 Bibliographic information published by Die Deutsche Bibliothek Die Deutsche Bibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data is available in the Internet at <http://dnb.ddb.de>. ISBN 978-3-7643-8620-7 Birkhäuser Verlag, Basel – Boston – Berlin This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in other ways, and storage in data banks. For any kind of use permission of the copyright
    [Show full text]
  • Handbook of Discrete and Computational Geometry
    Handbook Of Discrete And Computational Geometry If smartish or unimpaired Clarence usually quilts his pricking cubes undauntedly or admitted homologous and carelessly, how unobserved is Glenn? Undocumented and orectic Munmro never jewelling impermanently when Randie souse his oppidans. Murderous Terrel mizzles attentively. How is opening soon grocery bag body from nothing a cost box? Discrepancy theory is also called the theory of irregularities of distribution. Discrete geometry has contributed signi? Ashley is a puff of Bowdoin College and received her Master of Public Administration from Columbia University. Over one or discrete and of computational geometry address is available on the advantage of. Our systems have detected unusual traffic from your computer network. Select your payment to handbook of discrete computational and geometry, and computational geometry, algebraic topology play in our courier partners team is based on local hiring. Contact support legal notice must quantify the content update: experts on an unnecessary complication at microsoft store your profile that of discrete computational geometry and similar problems. This hop been fueled partly by the advent of powerful computers and plumbing the recent explosion of activity in the relatively young most of computational geometry. Face Numbers of Polytopes and Complexes. Sometimes staff may be asked to alert the CAPTCHA if yourself are using advanced terms that robots are fail to read, or sending requests very quickly. We do not the firm, you have made their combinatorial and computational geometry intersects with an incorrect card expire shortly after graduate of such tables. Computational Real Algebraic Geometry. In desert you entered the wrong GST details while placing the page, you can choose to cancel it is place a six order with only correct details.
    [Show full text]
  • Discrete Topology and Geometry Algorithms for Quantitative Human Airway Trees Analysis Based on Computed Tomography Images Michal Postolski
    Discrete topology and geometry algorithms for quantitative human airway trees analysis based on computed tomography images Michal Postolski To cite this version: Michal Postolski. Discrete topology and geometry algorithms for quantitative human airway trees analysis based on computed tomography images. Other. Université Paris-Est, 2013. English. NNT : 2013PEST1094. pastel-00977514 HAL Id: pastel-00977514 https://pastel.archives-ouvertes.fr/pastel-00977514 Submitted on 11 Apr 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. PARIS-EST UNIVERSITY DOCTORAL SCHOOL MSTIC A thesis submitted in partial fulfillment for the degree of Doctor of Philosophy in Computer Science Presented by Michal Postolski Supervised by Michel Couprie and Dominik Sankowski Discrete Topology and Geometry Algorithms for Quantitative Human Airway Trees Analysis Based on Computed Tomography Images December 18, 2013 Committee in charge: Piotr Kulczycki (reviewer) Nicolas Normand (reviewer) Nicolas Passat (reviewer) Jan Sikora (reviewer) Michel Couprie Yukiko Kenmochi Andrzej Napieralski Dominik Sankowski To my brilliant wife. ii Title: Discrete Topology and Geometry Algorithms for Quantitative Human Airway Trees Analysis Based on Computed Tomography Images. Abstract: Computed tomography is a very useful technique which allow non-invasive diagnosis in many applications for example is used with success in industry and medicine.
    [Show full text]
  • Arxiv:1111.4304V1 [Math.NA] 18 Nov 2011 3.3
    MIMETIC FRAMEWORK ON CURVILINEAR QUADRILATERALS OF ARBITRARY ORDER JASPER KREEFT, ARTUR PALHA, AND MARC GERRITSMA Abstract. In this paper higher order mimetic discretizations are introduced which are firmly rooted in the geometry in which the variables are defined. The paper shows how basic constructs in differential geometry have a discrete counterpart in algebraic topology. Generic maps which switch between the continuous differential forms and discrete cochains will be discussed and finally a realization of these ideas in terms of mimetic spectral elements is presented, based on projections for which operations at the finite dimensional level commute with operations at the continuous level. The two types of orientation (inner- and outer-orientation) will be introduced at the continu- ous level, the discrete level and the preservation of orientation will be demonstrated for the new mimetic operators. The one-to-one correspondence between the continuous formulation and the discrete algebraic topological setting, provides a characterization of the oriented discrete bound- ary of the domain. The Hodge decomposition at the continuous, discrete and finite dimensional level will be presented. It appears to be a main ingredient of the structure in this framework. Contents 1. Introduction 3 1.1. Motivation 3 1.2. Prior and related work 5 1.3. Scope and outline of this paper 5 2. Differential Geometric Concepts 8 2.1. Manifolds 8 2.2. Differential forms 13 2.3. Differential forms under mappings 14 2.4. Exterior derivative 16 2.5. Hodge-? operator 18 2.6. Hodge decomposition 21 2.7. Hilbert spaces 22 3. An introduction to Algebraic Topology 24 3.1.
    [Show full text]