The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A Simple Mesh Generator in MATLAB
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
Osher, S., & Sethian, J. A. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90002-2 · Cited by 14,062
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator
Shewchuk, J. R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014497 · Cited by 2,115
Laplacian smoothing and Delaunay triangulations
Field, D. A. (1988) · Communications in Applied Numerical Methods · doi:10.1002/cnm.1630040603 · Cited by 735
Geometry and Topology for Mesh Generation
Edelsbrunner, & Benson (2002) · Applied Mechanics Reviews · doi:10.1115/1.1445302 · Cited by 435
Cited by
Seamless cross-scale modeling with SCHISM
Zhang, Y. J., Ye, F., Stanev, E. V., & Grashorn, S. (2016) · Ocean Modelling · doi:10.1016/j.ocemod.2016.05.002 · Cited by 597
Deep Learning the City: Quantifying Urban Perception at a Global Scale
Dubey, A., Naik, N., Parikh, D., Raskar, R., & Hidalgo, C. A. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46448-0_12 · Cited by 513
Active Subspace Methods in Theory and Practice: Applications to Kriging Surfaces
Constantine, P. G., Dow, E., & Wang, Q. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/130916138 · Cited by 506
Lie, K.-A. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108591416 · Cited by 483
Sukumar, N., & Srivastava, A. (2022) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2021.114333 · Cited by 426
Metadata
- Authors
- Persson, P.-O., & Strang, G.
- Venue
- SIAM Review
- Published
- 2004-01
- Volume
- 46
- Issue
- 2
- Pages
- 329-345
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2021036023
- Cited by
- 1,552
- References
- 4
- FWCI
- 38.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.