Meshing, Geometric Modeling and Numerical Simulation : V2 Metrics, Meshes and Meshes Adaptation.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: George, Paul-Louis
Otros Autores: Borouchaki, Houman, Alauzet, Frederic, Lang, Patrick, Loseille, Adrien, Mar¿chal, Loic
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Newark : John Wiley & Sons, Incorporated, 2019.
Temas:
Geometry > Data processing.
Géométrie > Informatique.
Geometry > Data processing
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Cover; Half-Title Page; Title Page; Copyright Page; Contents; Foreword; Introduction; Chapter 1. Metrics, Definitions and Properties; 1.1. Definitions and properties; 1.2. Metric interpolation and intersection; 1.2.1. Metric interpolation; 1.2.2. Metric intersection; 1.3. Geometric metrics; 1.3.1. Geometric metric for a curve; 1.3.2. Geometric metric for a surface; 1.3.3. Turning any metric into a geometric metric; 1.4. Meshing metrics; 1.5. Metric gradation; 1.6. Element metric; 1.6.1. Metric of a simplicial element; 1.6.2. Metric of a non-simplicial element
  • 1.6.3. Metric of an element of arbitrary degree1.7. Element shape and metric quality; 1.8. Practical computations in the presence of a metric; 1.8.1. Calculation of the length; 1.8.2. The calculation of an angle, area or volume; Chapter 2. Interpolation Errors and Metrics; 2.1. Some properties; 2.2. Interpolation error of a quadratic function; 2.3. Bézier formulation and interpolation error; 2.3.1. For a quadratic function; 2.3.2. For a cubic function; 2.3.3. For a polynomial function of arbitrary degree; 2.3.4. Error threshold or mesh density; 2.4. Computations of discrete derivatives
  • 2.4.1. The L2 double projection method2.4.2. Green formula; 2.4.3. Least square and Taylor; Chapter 3. Curve Meshing; 3.1. Parametric curve meshing; 3.1.1. Curve in R3; 3.1.2. About metrics used and computations of lengths; 3.1.3. Curve plotted on a patch; 3.2. Discrete curve meshing; 3.3. Remeshing a meshed curve; Chapter 4. Simplicial Meshing; 4.1. Definitions; 4.2. Variety (surface) meshing; 4.2.1. Patch-based meshing; 4.2.2. Discrete surface remeshing; 4.2.3. Meshing using a volume mesher; 4.3. The meshing of a plane or of a volume domain; 4.3.1. Tree-based method
  • 4.3.2. Front-based method4.3.3. Delaunay-based method; 4.3.4. Remeshing of a meshed domain; 4.4. Other generation methods?; Chapter 5. Non-simplicial Meshing; 5.1. Definitions; 5.2. Variety meshing; 5.3. Construction methods for meshing a planar or volume domain; 5.3.1. Cylindrical geometry and extrusion method; 5.3.2. Algebraic methods and block-based methods; 5.3.3. Tree-based method; 5.3.4. Pairing method; 5.3.5. Polygonal or polyhedral cell meshing; 5.3.6. Construction of boundary layers; 5.4. Other generation methods; 5.4.1. "Q-morphism" or "H-morphism" meshing
  • 5.4.2. Meshing using a reference frame field5.5. Topological invariants (quadrilaterals and hexahedra); Chapter 6. High-order Mesh Construction; 6.1. Straight meshes; 6.1.1. Local node numbering; 6.1.2. Overall node numeration; 6.1.3. Node positions; 6.1.4. On filling up matrices according to element degrees; 6.2. Construction of curved meshes; 6.2.1. First-degree mesh; 6.2.2. Node creation; 6.2.3. Deformation and validation; 6.2.4. General scheme; 6.3. Curved meshes on a variety, curve or surface; Chapter 7. Mesh Optimization; 7.1. Toward a definition of quality; 7.2. Optimization process

Ejemplares similares