A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
MESH GENERATION AND OPTIMAL TRIANGULATION
[chapter]
1995
Lecture Notes Series on Computing
We survey the computational geometry relevant to nite element mesh generation. We especially focus on optimal triangulations of geometric domains in two-and three-dimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some criterion that measures the size, shape, or number of triangles. We discuss algorithms both for the optimization of triangulations on a xed set of vertices and for the placement of new vertices (Steiner
doi:10.1142/9789812831699_0003
fatcat:ec6436f5i5bszheuiherz452ae