我有兴趣阅读和理解二维网格算法。 在 Google 上搜索后发现 很多论文和资料来源,但大多数都过于学术化,不适合初学者。
那么,这里有人会推荐任何阅读源(适合初学者),或者我可以从一开始学习的开源实现吗? 谢谢。
另外,与三角形网格生成相比,我对四边形网格和混合网格(四边形和三角形组合)更感兴趣。
I am interested to read and understand the 2D mesh algorithms. A search on Google reveals a lot of papers and sources, however most are too academic and not much on beginner's side.
So, would anyone here recommend any reading sources ( suitable for the beginners), or open source implementation that I can learn from the start? Thanks.
Also, compared to triangular mesh generation, I have more interest in quadrilateral mesh and mix mesh( quad and tri combined).
发布评论
评论(2)
我赞同大卫关于 Jonathan Shewchuk 网站的回答,这是一个很好的起点。
就开源软件而言,这取决于您到底要寻找什么。
有关您目标的更多信息肯定有助于提供更多相关的指导。
I second David's answer regarding Jonathan Shewchuk's site as a good starting point.
In terms of open source software, it depends on what you are looking for exactly.
More informations about your goals would definitely help providing more relevant pointers.
Google 搜索中的第一个链接会将您带到Jonathan Shewchuk 的网站。 这实际上并不是一个糟糕的起点。 他有一个名为 triangle 的程序,您可以下载该程序进行 2D 三角测量。 该页面上有一个链接,指向创建三角形,包括指向三角测量算法。
网格生成有多种方法。 最常见的方法之一是创建 Delaunay 三角剖分。 对一组点进行三角测量相当简单,有多种算法可以做到这一点,包括 Watson 和 Rupert's 用于三角形
当您想要创建约束三角剖分时,其中三角剖分的边缘与输入形状的边缘相匹配,则有点困难,因为您需要恢复某些边缘。
我将从理解 Delaunay 三角剖分开始。 然后也许看看其他一些网格划分算法。
您会在网格生成论文中发现的一些常见主题是
3D 网格生成比 2D 困难得多,因此很多论文都在讨论 3D 生成
。网格生成是一个很大的主题。 如果您能提供一些有关您感兴趣的方面(例如 2D 或 3D)的更多信息,那将会很有帮助。如果您能提供一些您想要做什么的想法,那么也许我可以找到一些更好的信息来源。
The first link on your Google search takes you to Jonathan Shewchuk's site. This is not actually a bad place to start. He has a program called triangle which you can download for 2D triangulation. On that page there is a link to references used in creating triangle, including a link to a description of the triangluation algorithm.
There are several approaches to mesh generation. One of the most common is to create a Delaunay triangulation. Triangulating a set of points is fairly simple and there are several algorithms which do that, including Watson's and Rupert's as used in triangle
When you want to create a constrained triangulation, where the edges of the triangulation match the edges of your input shape it is a bit harder, because you need to recover certain edges.
I would start by understanding Delaunay triangulation. Then maybe look at some of the other meshing algorithms.
Some of the common topics that you will find in mesh generation papers are
3D mesh generation is much harder than 2D so a lot of the papers are on 3D generation
Mesh generation is a large topic. It would be helpful if you could give some more information on what aspects (eg 2D or 3D) that you are interested in. If you can give some idea of what you ant to do then maybe I can find some better sources of information.