
Meshing, Geometric Modeling and Numerical Simulation 3
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
many problems relating to a wide variety of scientific disciplines,
and in particular numerical simulations of all kinds of physical
phenomena.
In Volume 1, the theoretical foundations relating to triangulations,
finite element shape functions and their interpretations as
geometric patches were explored. This has made it possible to
build tools that make the geometric modeling of any object
possible. These elements are used in Volume 2 to treat meshing
problems in their different implementations.
Meshing, Geometric Modeling and Numerical Simulation 3 offers
technical additions to the methods seen in the first two volumes
and a significant portion of this book is dedicated to mesh
visualization problems and solutions, especially those with a high
degree of complexity.
More details
Other editions
Additional editions


Persons
Frédéric Alauzet and Adrien Loseille are researchers at Inria, both with particular expertise in meshing adaptation, error estimators, solution methods (advanced solvers in fluid mechanics), remeshing methods and high order methods, among other things.
Loïc Maréchal is a long-time collaborator at Inria as an engineer and a leading authority on hexahedra. He is also an expert on data structures and problems related to memory management.
Content
- Cover
- Half-Title Page
- Title Page
- Copyright Page
- Contents
- Foreword
- Introduction
- Chapter 1. Data and Basic Techniques
- 1.1. Basic data structures and basic techniques
- 1.1.1. Basic data structures
- 1.1.2. Basic techniques
- 1.2. Internal data structures
- 1.2.1. What should be stored in an internal structure and how?
- 1.2.2. Internal structures, method by method
- 1.3. External data structures
- 1.4. Data structures and memory access
- Chapter 2. Mesh Transformations, Patching, Merging and Immersion
- 2.1. Geometric transformations
- 2.1.1. Conventional geometric transformations
- 2.1.2. Cutting a non-simplicial element into simplices
- 2.1.3. Decomposition into simplices of a non-simplicial mesh
- 2.1.4. Decompositions for a complying connection
- 2.1.5. Decomposition of a high-degree element
- 2.2. Reconnection
- 2.3. Merging
- 2.4. Immersion
- Chapter 3. Renumbering and Memory
- 3.1. Vertex and node renumbering
- 3.1.1. Numbering and storage of a matrix in profile mode
- 3.1.2. Numbering and algorithm performance
- 3.1.3. Some methods for node renumbering
- 3.2. Renumbering of the elements
- 3.2.1. Motivation examples
- 3.2.2. Some methods for renumbering elements
- 3.2.3. Renumbering and mesh partition
- 3.3. Some examples
- Chapter 4. High-Degree Mesh Visualization
- 4.1. Geometric operators and topological operators
- 4.1.1. Geometric operators
- 4.1.2. Topological operators
- 4.2. Representation of curved meshes
- 4.3. Quick introduction to OpenGL and to the design of a graphics software program
- 4.4. Some examples
- Chapter 5. Visualization of a Solution Field Related to a High-Degree Mesh
- 5.1. Element recursive subdivision
- 5.2. Recursive subdivision of a solution field
- 5.3. Classic or adaptive tessellation
- 5.4. Toward the design of graphic software based on OpenGL
- 5.4.1. Palette definition
- 5.4.2. Cut definition
- 5.4.3. "Pixel-exact" or "almost pixel-exact" representation
- 5.4.4. Normals and shading
- 5.4.5. Level lines and surfaces and application to "wireframe" plots
- 5.4.6. Representation of non-scalar functions
- 5.4.7. Simplified scheme for a graphic software program
- 5.5. Some examples
- Chapter 6. Meshes and Finite Element Calculations
- 6.1. From continuous formulation to discrete notation
- 6.2. Calculation of an elementary matrix
- 6.2.1. The special case of the first-degree triangle
- 6.2.2. A generic notation for all elements
- 6.2.3. The generic notation for the four chosen elements and heat equation
- 6.2.4. Lagrange triangle of degree 1 with three nodes
- 6.2.4.1. Lagrange quadrilateral of degree 1 × 1 with four nodes
- 6.2.4.2. Straight-sided Lagrange triangle of degree 2 with six nodes
- 6.2.4.3. Lagrange isoparametric (curved) triangle of degree 2 with six nodes
- 6.2.4.4. In practice
- 6.2.5. The generic notation for the four chosen elements, elasticity equation
- 6.2.6. Lagrange triangle of degree 1 with three nodes
- 6.2.6.1. The other three elements
- 6.2.6.2. In practice
- 6.3. Matrix or right-hand side assembly
- Chapter 7. Meshes and Finite Volume Calculation
- 7.1. Presentation of the finite volume method with a first-order problem
- 7.1.1. Time discretization
- 7.1.2. Spatial discretization
- 7.2. Finite volume methods for two-dimensional Euler equations
- 7.2.1. Spatial discretization
- 7.2.1.1. Finite volume cell definition
- 7.2.1.2. Calculation of upwind conservative fluxes
- 7.2.2. Time discretization
- 7.3. From theory to practice
- 7.3.1. Data structures
- 7.3.2. Resolution algorithms
- 7.4. Numerical examples
- Chapter 8. Examples Through Practice
- 8.1. Reading, writing and manipulating a mesh
- 8.2. Programming a hashing algorithm
- 8.3. One point insertion operator per cavity, application to image compression
- 8.4. Retrieving a connected component
- 8.5. Exercises on metrics
- Chapter 9. Some Algorithms and Formulas
- 9.1. Bernstein polynomials and Bézier forms
- 9.1.1. Bernstein polynomials
- 9.1.2. Bézier forms
- 9.1.3. Formulas (lengths, surface areas and volumes) for curved elements
- 9.2. Localization problems in a curved mesh
- 9.2.1. Current point parameter values
- 9.2.2. Localization
- 9.3. Space-filling curves
- 9.3.1. A Z-curve
- 9.3.2. A Hilbert curve
- Conclusion and Perspectives
- Bibliography
- Index
- Other titles from iSTE in Numerical Methods in Engineering
- EULA
Introduction
Triangulations and, more precisely, meshes, with the subtle difference that separates these two entities, lie at the heart of any number of problems that arise from varied scientific disciplines. A triangulation or a mesh is a discrete representation, using simple geometric elements (triangle, quadrilateral, tetrahedron, etc., any arbitrary polygon or polyhedron), of a domain that may be an object or a region of which we want a discrete, spatial description. There are, thus, many applications, including numerical simulations of any kind of physical problem, though not restricted to these. In particular, a discrete representation of a (volume) object or a surface may simply be seen as a geometric modeling problem as is. This book adopts a double point of view, as indicated by its title, and we will look both at the use of meshes in numerical simulations (the finite element method, especially) with, of course, the underlying constraints, as well as the use of these meshes for the (discrete) modeling of geometry.
The literature on triangulations and meshes may be classified in two chief categories: one more purely mathematical and geometric, the other more oriented toward industrial applications (numerical simulations) with, of course, though not always, relations between these categories.
The first point of view is covered by the computation geometry community, which studies (among others) Delaunay triangulations in all cuts, definitions, properties, construction algorithms and the complexity of these algorithms. They also study some applications of these triangulations. Nonetheless, relatively recently, mesh generation problems are also being studied, but under a more theoretical angle, generally relating to situations that allow for the use of Delaunay triangulations for which robust construction methods as well as interesting geometric properties have been known for a long time. This (somewhat monotheistic) philosophy necessarily imposes limits on the nature of the problems worked (workable). The first reference book on these subjects is that of Preparata and Shamos [Preparata, Shamos-1985] published in 1985. This was followed by several others, among which we cite two by Edelsbrunner [Edelsbrunner-1987] and [Edelsbrunner-2001], that of Yvinnec and Boissonnat [Boissonnat, Yvinec-1997], by Dey [Dey-2007] and winding up the list with the book by Cheng et al. [Cheng et al. 2012], which was published in 2012. With a few exceptions, the orientation chosen by these references is not always guided by the preoccupations of mathematicians, engineers and the world of numerical simulation in general.
It is this very need for numerical simulations, in particular (and historically) in solid or fluid mechanics, that has led to the emergence of a "meshing" community among mathematicians and engineers. Without fear of contradiction, we can state that the very first book on meshes that was seen from this point of view is that of Thompson et al. [Thompson et al. 1985], which was also published in 1985. This book essentially discusses structured meshes or grids1 while the first truly generalist book, discussing all types of meshes, structured or not, is that by George [George-1991], which dates back to 1991. Over the years and with the evolution of computers and methods as well as the increasingly complex nature of the meshes to consider, other books have been published. Let us mention books by George and Borouchaki [George, Borouchaki-1998], published in 1997, which revisits meshing methods based on Delaunay algorithms; by Carey [Carey-1997], also in 1997, which gives a very pedagogic presentation of methods; by Topping and co-authors [Topping et al. 2004], in 2004, cited in order to be exhaustive; by Frey and George [Frey, George-2008], in 2000, with a second edition in 2008, which returns to the general view and incorporates newly appeared techniques; by Löhner [Löhner-2008], in 2002, with a second edition that came out in 2008, which abounds in innovative details; up to the recent book by Lo [Lo-2015], published in 2015, which, among others, sheds new light on some problems. In this context, we may wonder what motivated the writing of this book. We will attempt to answer this question (and also try, by doing so, to arouse the reader's curiosity).
The first observation is that the few books on this subject are already either a little old or rather classic in the way they discuss the approaches and the methods concerning the many questions linked to meshes. The second remark is that, evidently, new questions have appeared relatively recently, e.g. everything related to (finite) elements or patches of higher degrees, metrics and their links to interpolation errors, geometric modeling by meshes, numerical simulation via advanced methods (adaptation of meshes) and so on. This remark immediately calls forth another: we will resolutely adopt a double point of view by considering finite elements (or the constitutive elements of a mesh) as geometric patches and vice versa, thus establishing a link between the Lagrange world of finite elements and the Bézier world of CAD. This choice, as we will see, noticeably changes the manner in which we perceive the problems and, consequently, the manner in which we try to find solutions. In this spirit, this book in two volumes, beyond a set of subjects that we may qualify as classic (and, thus, essential), approaches many subjects that are very recent or even completely novel. Moreover, and this may be more surprising (and certainly rare), some methods (which we find in the literature) have been deliberately left out as they were deemed to not be of great interest and, a contrario, some methods are described in a manner that is, at the very least, nuanced and even critical. Indeed, it seemed pertinent to share our perception, even though this is subjective, up to a point, of these methods, perhaps to prevent the reader from going down paths that we think are dead ends. Having specified this, this book provides the necessary basis for a course on meshes and related problems at the masters level and it may serve as a technical reference for engineering students in science and, more generally, engineers using numerical simulations. We will give a brief description of the content of the chapters in both volumes.
Volume 1:
We first give a chapter-wise overview of the first volume of this book. In the first three chapters, this volume introduces the basic concepts related to finite elements seen through their shape functions either as finite elements or as patches. In addition to the classic expression via Lagrange polynomials (complete, reduced or rational) (Chapter 1), we give the equivalent formulation based on Bézier forms (Chapter 2), which makes it possible to easily find the conditions for the geometric validity of these finite elements (or patches) whether they are straight or curved and whatever their degree (Chapter 3). Triangulation problems are the subject of the next three chapters, where we specify vocabulary and the basic concepts that make it possible to describe the different construction methods for any triangulation (Chapter 4), Delaunay triangulation (Chapter 5) as well as the triangulation (of a domain) with constraints (Chapter 6). In the next two chapters, we use the concepts introduced earlier to discuss the vast problem of geometric modeling of a domain in its various aspects. Geometric modeling, from our point of views (meshes and numerical simulations), consists of construction of a discrete representation from a continuous representation and vice versa. Different methods are described in Chapters 7, while Chapter 8 gives several significant examples for the application of these methods. Chapter 9 brings together some basic algorithms and formulas related to finite elements (patches) and triangulations, to persuade the reader to go beyond a theoretical viewpoint, to a practical viewpoint, which we believe is essential.
? Volume 2:
We share the contents of Volume 2 of this book, for which four new authors have joined us. This volume (finally) approaches mesh problems and begins with a detailed description of the concept of metric, a concept which will be seen to be fundamental in all that follows. The first two chapters, Chapters 1 and 2, thus focus on metrics. We introduce the concept of metric, we demonstrate their properties and their relations with the geometry of elements of a mesh and how to control interpolation errors during the resolution of a problem (by finite elements). The construction methods of meshes and their optimization are the focus of the following five chapters: Chapter 3 (mesh for a curve), Chapter 4 (simplicial meshes), Chapter 5 (non-simplicial meshes), Chapter 6 (meshes of higher degree) and Chapter 7 (optimizing meshes). We will then discuss the large subject of the adaptation of meshes, controlling the solutions via error estimates and corresponding interpolation metrics in Chapter 8. The use of a dose or a certain dose of parallelism (based on its multiple forms) is seen through Chapter 9. Chapter 10 illustrates, using concrete examples, a series of applications of the methods and methodologies introduced and described through the different chapters of both volumes of this book. As in Volume 1, the final chapter, Chapter 11, gives practical observations on some of the algorithms from Volume 2, especially how to use and manipulate metrics.
? Volume 3:
After completing the first two volumes, it seemed that is was obvious that a third volume had to be written. A...
System requirements
File format: ePUB
Copy protection: Adobe-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Install the free reader Adobe Digital Editions prior to download (see eBook Help).
- Tablet/smartphone (Android; iOS): Install the free app Adobe Digital Editions or the app PocketBook before downloading (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (not Kindle).
The file format ePub works well for novels and non-fiction books – i.e., „flowing” text without complex layout. On an e-reader or smartphone, line and page breaks automatically adjust to fit the small displays.
This eBook uses Adobe-DRM, a „hard” copy protection. If the necessary requirements are not met, unfortunately you will not be able to open the eBook. You will therefore need to prepare your reading hardware before downloading.
Please note: We strongly recommend that you authorise using your personal Adobe ID after installation of any reading software.
For more information, see our ebook Help page.