德劳内三角测量
计算机科学
多边形网格
稳健性(进化)
算法
MATLAB语言
网格生成
Bowyer–Watson算法
子程序
顶点(图论)
约束Delaunay三角剖分
拓扑(电路)
理论计算机科学
计算科学
图形
数学
计算机图形学(图像)
有限元法
程序设计语言
物理
组合数学
生物化学
化学
基因
热力学
作者
Per‐Olof Persson,Gilbert Strang
出处
期刊:Siam Review
[Society for Industrial and Applied Mathematics]
日期:2004-01-01
卷期号:46 (2): 329-345
被引量:1548
标识
DOI:10.1137/s0036144503429121
摘要
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 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
科研通智能强力驱动
Strongly Powered by AbleSci AI