Mesh reading and Mesh library

Question

I am interested in reading and understanding 2D mesh algorithms. A Google search shows a lot of documents and sources , but most of them are too academic and not very familiar with a beginner.

So, will anyone here recommend reading sources (suitable for beginners) or an open source implementation that I can learn from the start? Thanks.

In addition, compared to the generation of a triangular grid, I have more interest in a quadrangular grid and a blending grid (four and three combined).

Answer 1

David's second answer regarding the site of Jonathan Shelchuk is a good starting point.

As for open source software, it depends on what you are looking for exactly.

• If you are interested in grid generation, you can see the CGAL code. Understanding the low-level parts of CGAL code is too much for a beginner. However, looking at higher-level algorithms can be quite interesting even for a beginner. Also note that the CGAL documentation documentation is very detailed.
• You can also look at TetGen , but its source code is monolithic and not documented (it is more than a library, even if it can also be called just from other programs). Nevertheless, it is quite readable, and the user manual contains a short presentation of grid generation with some links.
• If you are also interested in mesh processing, you can take a look at OpenMesh .

Additional information about your goals will certainly help provide more relevant pointers.

Answer 2

The first link in your Google search will take you to Jonathan Shelchuk’s site . This is actually not a bad place to start. He has a program called triangle , which you can download for 2D triangulation. On this page there is a link to the links used in creating the triangle , including a link to the description of the trihedral algorithm .

There are several approaches to grid generation. One of the most common is the creation of Delaunay triangulation . Triangulating multiple points is quite simple and there are several algorithms that do this, including Watson and Rupert's , as used in a triangle. When you want to create a limited triangulation where the edges of the triangulation correspond to the edges of your input form, this is a little more complicated because you need to restore certain edges .

I would start by understanding the Delaunay triangulation. Then maybe look at some of the other grid algorithms.

Some common topics you will find in documents for creating a grid,

• Reliability - this is how to deal with floating point rounding errors.
• Grid quality - ensuring the shape of triangles / tetrahedrons is close to equilateral. Whether this is important depends on why you are creating the grid. For analytical work, this is very important,
• How to choose where to insert nodes into the grid to ensure good grid distribution.
• Gearing speed
• Quad / Hex mesh generation. This is more complicated than using triangles / tetrahedrons.

Generating a 3D mesh is much more complicated than 2D, so many work on the 3D generation

Grid generation is a big topic. It would be useful if you could give additional information about which aspects (for example, 2D or 3D) are of interest to you. If you can give some idea that you are ant, then maybe I can find some better sources of information.