OpenGrey (Institut de l'Information Scientifique et Technique) · 1998 · 31 citations · 0 references
ComputingComputer ScienceComputational GeometryGrid ComputingDelaunay TriangulationsGeometry ProcessingGrid GenerationMesh GenerationMesh ProcessingDelaunay Triangulation AlgorithmsTetrahedral Mesh GenerationTetrahedral MeshingUnstructured Grid GenerationUnstructured Tetrahedral Grids
. An algorithm for constructing almost regular triangulations (ARTs) for three-dimensional polygonal domains is described. Ideally such triangulations consist entirely of congruent tetrahedra with nearly equal edges. The new feature of this method is that the position of the vertices is adjusted, before any connecting edges are assigned. This leads to grids with very few irregular vertices, i.e. most interior vertices are shared by 24 tetrahedra as for regular tessellations of R 3 with congruent tetrahedra. keywords. delaunay tetrahedra, tessellation of R 3 , almost regularity 1 Introduction Grid generation algorithms are essential tools in many areas of modern applied mathematics. Typical examples are finite element methods (FEM, [2]) and geometric modelling (CAGD, [4]). In both applications the quality of the grids strongly influences the accuracy of numerical computations. For example, irregularly shaped tetrahedra result in large condition numbers of the stiffness matrices for G...