Portal de Periódicos da CAPES

A Simple Mesh Generator in MATLAB

2004; Society for Industrial and Applied Mathematics; Volume: 46; Issue: 2 Linguagem: Inglês

10.1137/s0036144503429121

1095-7200

Per‐Olof Persson, Gilbert Strang,

Robotic Path Planning Algorithms

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.