algorithm - 寻找变密度三角剖分的非结构化网格生成算法

Question

我正在寻找一种网格生成算法，该算法可以生成具有多个高密度三角剖分点的非结构化网格。这就是我正在寻找的东西，没有没有三角测量的空白点:

如果您不知道用于此目的的特定算法的名称，您是否知道我可以使用哪些关键字来搜索我要查找的内容？另外，我不确定这是否是最好的询问地点。如果有其他交流我可能会找到更好的帮助，请告诉我。谢谢。

Answer 1

生成非均匀网格的一种方法是首先根据某种概率分布随机散布点，然后以某种方式松弛它们的位置以获得质量好的网格。 this paper 中描述了一种简单而有效的算法。作者:P.-O.Persson 和 G.Strang。

Creating a mesh is the first step in a wide range of applications, including scientific computing and computer graphics. An unstructured simplex mesh requires a choice of meshpoints (vertex nodes) and a triangulation. We want to offer a short and simple Matlab code, described in more detail than usual, so the reader can experiment (and add to the code) knowing the underlying principles. We find the node locations by solving for equilibrium in a truss structure (using piecewise linear force-displacement relations) and reset the topology by the Delaunay algorithm. The geometry is described implicitly by its distance function. In addition to being much shorter and simpler than other meshing techniques, our algorithm typically produces meshes of very high quality. We discuss ways to improve the robustness and the performance, but our aim here is simplicity. Readers can download (and edit) the codes from http://math.mit.edu/~persson/mesh.

全文可用here .