Abstract
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 we 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…
Citation impact
1,546
total citations
- FWCI
- 28.34
- Percentile
- 100%
- References
- 12
Citations per year
Authors
2Topics & keywords
Topics
Keywords
- Computer science
- Delaunay triangulation
- Polygon mesh
- Robustness (evolution)
- Algorithm
- MATLAB
- Mesh generation
- Bowyer–Watson algorithm
UN Sustainable Development Goals
- Quality Education
No related works found for this paper.