Muutke küpsiste eelistusi

E-raamat: Mesh Generation: Application to Finite Elements

(INRIA, France), (UPMC Paris 6)
  • Formaat: EPUB+DRM
  • Ilmumisaeg: 11-Mar-2013
  • Kirjastus: ISTE Ltd and John Wiley & Sons Inc
  • Keel: eng
  • ISBN-13: 9781118623824
  • Formaat - EPUB+DRM
  • Hind: 280,28 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Raamatukogudele
  • Formaat: EPUB+DRM
  • Ilmumisaeg: 11-Mar-2013
  • Kirjastus: ISTE Ltd and John Wiley & Sons Inc
  • Keel: eng
  • ISBN-13: 9781118623824

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Substantially updated throughout, and with a new chapter on mobile or deformable meshes by Frey, the second edition continues the format of the 1st, with the material presented in a format that moves from basic principles to advanced methods and specialized topics. The initial chapters discuss current mesh generation methods, including algebraic, PDE-based or multi-block; quadtree-octree based methods; and Delaunay-type methods. Subsequent chapters discuss Delaunay-admissible curve or surface meshes, medial axis construction, metric aspects, curves and surfaces, and mesh modification tools. Applications are considered throughout. The 1st edition was published in French, this updated version is also its first translation into English. Annotation ©2008 Book News, Inc., Portland, OR (booknews.com)

The aim of the second edition of this book is to provide a comprehensive survey of the different algorithms and data structures useful for triangulation and meshing construction. In addition, several aspects are given full coverage, such as mesh modification tools, mesh evaluation criteria, mesh optimization, adaptive mesh construction and parallel meshing techniques.
This new edition has been comprehensively updated and also includes a new chapter on mobile or deformable meshes.
Introduction 11(6)
Symbols and Notations 17(2)
General Definitions
19(20)
Covering-up and triangulation
20(4)
Mesh, mesh element, finite element mesh
24(7)
Mesh data structures
31(8)
Control space and neighborhood space
39(56)
Mesh quality and mesh optimality
41(4)
Basic Structures and Algorithms
45(1)
Why use data structures?
46(2)
Elementary structures
48(5)
Basic notions about complexity
53(3)
Sorting and searching
56(6)
One-dimensional data structures
62(7)
Two and three-dimensional data structures
69(5)
Topological data structures
74(3)
Robustness
77(3)
Optimality of an implementation
80(3)
Examples of generic algorithms
83(12)
A Comprehensive Survey of Mesh Generation Methods
95(38)
Classes of methods
96(1)
Structured mesh generators
97(7)
Algebraic interpolation methods
98(2)
PDE-based methods
100(1)
Multiblock method
101(2)
Product method (topology-based method)
103(1)
Unstructured mesh generators
104(18)
Spatial decomposition methods
106(3)
Advancing-front method
109(5)
Delaunay technique
114(3)
Tentative comparison of the three classical methods
117(2)
Other methods
119(3)
Surface meshing
122(6)
Mesh generation via a parametric space
122(2)
Implicit surface triangulation
124(1)
Direct surface meshing
125(1)
Surface remeshing
126(2)
Mesh adaptation
128(1)
Parallel unstructured meshing
129(4)
Algebraic, PDE and Multiblock Methods
133(30)
Algebraic methods
133(16)
Trivial mapping functions
134(1)
Quadrilateral or triangular analogy
135(8)
Surface meshing
143(1)
Hexahedral, pentahedral or tetrahedral analogy
144(3)
Other algebraic methods and alternative methods
147(2)
PDE-based methods
149(4)
Basic ideas
149(4)
Surface meshing and complex shapes
153(1)
Multiblock method
153(10)
Basic ideas
153(1)
Partitioning the domain
154(1)
Computational issues and application examples
155(8)
Quadtree-octree Based Methods
163(38)
Overview of spatial decomposition methods
164(7)
Classical tree-based mesh generation
171(18)
Governed tree-based method
189(3)
Other approaches
192(3)
Extensions
195(6)
Advancing-front Technique for Mesh Generation
201(34)
A classical advancing-front technique
203(17)
Governed advancing-front method
220(5)
Application examples
225(2)
Combined approaches
227(3)
Extensions
230(5)
Delaunay-based Mesh Generation Methods
235(40)
Voronoi diagram and Delaunay triangulation
236(9)
Constrained triangulation
245(5)
Maintaining a constrained entity
245(1)
Enforcing a constraint
246(4)
Classical Delaunay meshing
250(11)
Simplified Delaunay type triangulation method
252(2)
Boundary integrity and domain identification
254(1)
Field point creation
255(2)
Optimization
257(1)
Practical issues
258(1)
Application examples
259(2)
Other methods
261(3)
Point insertion methods
262(1)
Field point creation
262(1)
Boundary enforcement
263(1)
Isotropic governed Delaunay meshing
264(3)
Extensions
267(8)
Weighted Delaunay triangulation
268(1)
Anisotropic Delaunay meshing
268(5)
Surface meshing
273(2)
Other Types of Mesh Generation Methods
275(28)
Product method
276(4)
Grid or pattern-based methods
280(3)
Optimization-based method
283(7)
Quads by means of triangle combination
290(6)
Quads by means of a direct method
296(2)
Hex meshing
298(2)
Miscellaneous
300(3)
Delaunay Admissibility, Medial Axis and Applications
303(28)
Delaunay-admissible set of segments in R2
304(6)
Delaunay-admissible set of segments in R3
310(2)
Delaunay-admissible set of triangular faces
312(6)
Medial axis
318(7)
Mid-surface
325(1)
Applications
326(5)
Quadratic Forms and Metrics
331(30)
Bilinear and quadratic forms
332(5)
Distances and lengths
337(5)
Metric-based operations
342(8)
Metric construction
350(11)
Parametric surface meshing
351(1)
Finite element simulation with error control
352(9)
Differential Geometry
361(34)
Metric properties of curves and arcs
362(15)
Metric properties of a surface
377(10)
Computational issues about surfaces
387(5)
Non-linear problems
392(3)
Curve Modeling
395(40)
Interpolation and smoothing techniques
397(3)
Lagrange and Hermite interpolation
400(4)
Explicit construction of a composite curve
404(2)
Control polygon based methods
406(3)
Bezier curves
409(5)
From composite curves to B-splines
414(9)
Rational curves
423(4)
Curve definitions and numerical issues
427(4)
Towards a ``pragmatic'' curve definition?
431(4)
Surface Modeling
435(28)
Specific surfaces
436(1)
Interpolation-based surfaces
437(5)
Tensor product and control polyhedron
442(4)
Triangular patches and Bezier triangles
446(4)
Other types of patches
450(2)
Composite surfaces
452(5)
Explicit construction of a composite surface
457(6)
Curve Meshing
463(28)
Meshing a segment
464(7)
Meshing a parametric curve
471(12)
Curve meshing using a discrete definition
483(3)
Re-meshing algorithm
486(2)
Curves in R3
488(3)
Surface Meshing and Re-meshing
491(36)
Curve meshing (curve member of a surface)
492(1)
First steps in surface meshing
493(10)
A single patch
503(10)
Multi-patches surface (patch-dependent)
513(2)
Multi-patches surface (patch-independent)
515(2)
Ill-defined multi-patches surface
517(2)
Molecular surfaces
519(2)
Surface reconstruction
521(2)
Discrete surface (re-meshing process)
523(4)
Meshing Implicit Curves and Surfaces
527(32)
Review of implicit functions
528(5)
Implicit function and meshing
533(4)
Implicit curve meshing
537(8)
Implicit surface meshing
545(11)
Extensions
556(3)
Mesh Modifications
559(32)
Mesh (geometric) modifications
559(8)
Merging two meshes
567(6)
Node creation and node labeling
573(4)
Renumbering issues
577(10)
Miscellaneous
587(4)
Mesh Optimization
591(32)
About element measurement
592(4)
Mesh quality (classical case)
596(6)
Mesh quality (isotropic and anisotropic case)
602(4)
Tools for mesh optimization
606(11)
Strategies for mesh optimization
617(1)
Computational issues
618(1)
Application examples
619(4)
Surface Mesh Optimization
623(40)
Quality measures
624(8)
Discrete evaluation of surface properties
632(11)
Constructing a geometric support
643(2)
Optimization operators
645(9)
Optimization methods
654(2)
Application examples
656(7)
A Touch of Finite Elements
663(30)
Introduction to a finite element style computation
664(4)
Definition and first examples of finite elements
668(4)
Error estimation and convergence
672(5)
Stiffness matrix and right-hand side
677(13)
A few examples of popular finite elements
690(3)
Mesh Adaptation and H-methods
693(42)
Control space (background mesh)
694(7)
Adaptation by local modifications
701(7)
Global isotropic adaptation method
708(8)
Global anisotropic adaptation method
716(6)
Adaptation
722(5)
General framework of a local adaptation method
722(2)
General framework of a global adaptation method
724(3)
Application examples
727(8)
Mesh Adaptation and P or Hp-methods
735(18)
P2 mesh
736(6)
P-compatibility
742(5)
Construction of P2 elements
747(3)
Elements of higher degree
750(1)
P-methods and hp-methods
751(2)
Moving or Deformable Meshing Techniques
753(22)
Rigid body motion
754(4)
ALE methods
758(6)
Mesh deformation
764(3)
Interface tracking
767(8)
Parallel Computing and Meshing Issues
775(24)
Partition of a domain
776(14)
Parallel meshing process
790(2)
Parallel meshing techniques
792(7)
Bibliography 799(44)
Index 843
Pascal Jean Frey, UPMC Paris 6, France Paul-Louis George, INRIA, France