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.
%0 Journal Article
%1 citeulike:9098724
%A Persson, Per-Olof
%A Strang, Gilbert
%D 2004
%J SIAM Review
%K 65n50-pdes-bvps-mesh-generation-and-refinement 65m50-pdes-ibvps-mesh-generation-and-refinement
%N 2
%P 329--345
%R 10.1137/s0036144503429121
%T A Simple Mesh Generator in MATLAB
%U http://dx.doi.org/10.1137/s0036144503429121
%V 46
%X 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.
@article{citeulike:9098724,
abstract = {{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.}},
added-at = {2017-06-29T07:13:07.000+0200},
author = {Persson, Per-Olof and Strang, Gilbert},
biburl = {https://www.bibsonomy.org/bibtex/298612ab49f66572d36b297b6f1c7a034/gdmcbain},
citeulike-article-id = {9098724},
citeulike-attachment-1 = {persson04mesh.pdf; /pdf/user/gdmcbain/article/9098724/634274/persson04mesh.pdf; a168759976ce4ea86f3196a54405f0b859182be2},
citeulike-linkout-0 = {http://dx.doi.org/10.1137/s0036144503429121},
comment = {(private-note)This is the paper describing 'DISTMESH':http://persson.berkeley.edu/distmesh .},
doi = {10.1137/s0036144503429121},
file = {persson04mesh.pdf},
interhash = {10bf918cdc3f63aeffdc1c9f6bf6bf9f},
intrahash = {98612ab49f66572d36b297b6f1c7a034},
issn = {0036-1445},
journal = {SIAM Review},
keywords = {65n50-pdes-bvps-mesh-generation-and-refinement 65m50-pdes-ibvps-mesh-generation-and-refinement},
month = jan,
number = 2,
pages = {329--345},
posted-at = {2011-04-05 00:17:07},
priority = {5},
timestamp = {2019-04-04T01:14:36.000+0200},
title = {A Simple Mesh Generator in {MATLAB}},
url = {http://dx.doi.org/10.1137/s0036144503429121},
volume = 46,
year = 2004
}