Meshing, Geometric Modeling and Numerical Simulation 3
Home > Science, Technology & Agriculture > Civil engineering, surveying and building > Meshing, Geometric Modeling and Numerical Simulation 3: Storage, Visualization and In Memory Strategies
Meshing, Geometric Modeling and Numerical Simulation 3: Storage, Visualization and In Memory Strategies

Meshing, Geometric Modeling and Numerical Simulation 3: Storage, Visualization and In Memory Strategies


     0     
5
4
3
2
1



International Edition


X
About the Book

Triangulations, and more precisely meshes, are at the heart of 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.

Table of Contents:
Foreword ix Introduction xi Chapter 1 Data and Basic Techniques 1 1.1 Basic data structures and basic techniques 1 1.1.1 Basic data structures 2 1.1.2 Basic techniques 22 1.2 Internal data structures 29 1.2.1 What should be stored in an internal structure and how? 29 1.2.2 Internal structures, method by method 31 1.3 External data structures 34 1.4 Data structures and memory access 36 Chapter 2 Mesh Transformations, Patching, Merging and Immersion 39 2.1 Geometric transformations 40 2.1.1 Conventional geometric transformations 40 2.1.2 Cutting a non-simplicial element into simplices 46 2.1.3 Decomposition into simplices of a non-simplicial mesh 48 2.1.4 Decompositions for a complying connection 56 2.1.5 Decomposition of a high-degree element 57 2.2 Reconnection 58 2.3 Merging 65 2.4 Immersion 77 Chapter 3 Renumbering and Memory 81 3.1 Vertex and node renumbering 82 3.1.1 Numbering and storage of a matrix in profile mode 82 3.1.2 Numbering and algorithm performance 84 3.1.3 Some methods for node renumbering 86 3.2 Renumbering of the elements 92 3.2.1 Motivation examples 92 3.2.2 Some methods for renumbering elements 92 3.2.3 Renumbering and mesh partition 94 3.3 Some examples 98 Chapter 4 High-Degree Mesh Visualization 105 4.1 Geometric operators and topological operators 106 4.1.1 Geometric operators 106 4.1.2 Topological operators 107 4.2 Representation of curved meshes 107 4.3 Quick introduction to OpenGL and to the design of a graphics software program 116 4.4 Some examples 136 Chapter 5 Visualization of a Solution Field Related to a High-Degree Mesh 145 5.1 Element recursive subdivision 146 5.2 Recursive subdivision of a solution field 152 5.3 Classic or adaptive tessellation 154 5.4 Toward the design of graphic software based on OpenGL 156 5.4.1 Palette definition 157 5.4.2 Cut definition 160 5.4.3 "Pixel-exact" or "almost pixel-exact" representation 169 5.4.4 Normals and shading 170 5.4.5 Level lines and surfaces and application to "wireframe" plots 171 5.4.6 Representation of non-scalar functions 176 5.4.7 Simplified scheme for a graphic software program 177 5.5 Some examples 181 Chapter 6 Meshes and Finite Element Calculations 185 6.1 From continuous formulation to discrete notation 187 6.2 Calculation of an elementary matrix 189 6.2.1 The special case of the first-degree triangle 190 6.2.2 A generic notation for all elements 191 6.2.3 The generic notation for the four chosen elements and heat equation 197 6.2.4 Lagrange triangle of degree 1 with three nodes 197 6.2.4.1 Lagrange quadrilateral of degree 1 × 1 with four nodes 201 6.2.4.2 Straight-sided Lagrange triangle of degree 2 with six nodes 209 6.2.4.3 Lagrange isoparametric (curved) triangle of degree 2 with six nodes 218 6.2.4.4 In practice 230 6.2.5 The generic notation for the four chosen elements, elasticity equation 233 6.2.6 Lagrange triangle of degree 1 with three nodes 233 6.2.6.1 The other three elements 235 6.2.6.2 In practice 235 6.3 Matrix or right-hand side assembly 237 Chapter 7 Meshes and Finite Volume Calculation 243 7.1 Presentation of the finite volume method with a first-order problem 243 7.1.1 Time discretization 244 7.1.2 Spatial discretization 245 7.2 Finite volume methods for two-dimensional Euler equations 249 7.2.1 Spatial discretization 250 7.2.1.1 Finite volume cell definition 251 7.2.1.2 Calculation of upwind conservative fluxes 252 7.2.2 Time discretization 256 7.3 From theory to practice 257 7.3.1 Data structures 257 7.3.2 Resolution algorithms 259 7.4 Numerical examples 260 Chapter 8 Examples Through Practice 265 8.1 Reading, writing and manipulating a mesh 266 8.2 Programming a hashing algorithm 269 8.3 One point insertion operator per cavity, application to image compression 272 8.4 Retrieving a connected component 281 8.5 Exercises on metrics 283 Chapter 9 Some Algorithms and Formulas 293 9.1 Bernstein polynomials and Bézier forms 293 9.1.1 Bernstein polynomials 293 9.1.2 Bézier forms 294 9.1.3 Formulas (lengths, surface areas and volumes) for curved elements 296 9.2 Localization problems in a curved mesh 301 9.2.1 Current point parameter values 301 9.2.2 Localization 305 9.3 Space-filling curves 306 9.3.1 A Z-curve 306 9.3.2 A Hilbert curve 309 Conclusion and Perspectives 313 Bibliography 315 Index 319

About the Author :
Paul Louis George is Emeritus Director of Research at the French Institute for Research in Computer Science and Automation (Inria), France, and one of the most internationally recognized experts in meshing. 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.


Best Sellers


Product Details
  • ISBN-13: 9781786306098
  • Publisher: ISTE Ltd and John Wiley & Sons Inc
  • Publisher Imprint: ISTE Ltd and John Wiley & Sons Inc
  • Height: 10 mm
  • No of Pages: 352
  • Returnable: N
  • Sub Title: Storage, Visualization and In Memory Strategies
  • Width: 10 mm
  • ISBN-10: 1786306093
  • Publisher Date: 18 Dec 2020
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 10 mm
  • Weight: 454 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Meshing, Geometric Modeling and Numerical Simulation 3: Storage, Visualization and In Memory Strategies
ISTE Ltd and John Wiley & Sons Inc -
Meshing, Geometric Modeling and Numerical Simulation 3: Storage, Visualization and In Memory Strategies
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Meshing, Geometric Modeling and Numerical Simulation 3: Storage, Visualization and In Memory Strategies

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!