Filters

2006 - 200912010 - 20173

More filters

20194
Reset filters

Settings

DDC: 510 × Subject: mesh quality ×

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    Tetrahedral mesh improvement using moving mesh smoothing, lazy searching flips, and RBF surface reconstruction
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2017) Dassi, Franco; Kamenski, Lennard; Farrell, Patricio; Si, Hang
    Given a tetrahedral mesh and objective functionals measuring the mesh quality which take into account the shape, size, and orientation of the mesh elements, our aim is to improve the mesh quality as much as possible. In this paper, we combine the moving mesh smoothing, based on the integration of an ordinary differential equation coming from a given functional, with the lazy flip technique, a reversible edge removal algorithm to modify the mesh connectivity. Moreover, we utilize radial basis function (RBF) surface reconstruction to improve tetrahedral meshes with curved boundary surfaces. Numerical tests show that the combination of these techniques into a mesh improvement framework achieves results which are comparable and even better than the previously reported ones.
  • Thumbnail Image
    Item
    Adaptive tetrahedral mesh generation by constrained delaunay refinement
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2006) Si, Hang
    This paper discusses the problem of refining a constrained Delaunay tetrahedralization (CDT) for adaptive numerical simulation. A simple and efficient algorithm which makes use of the classical Delaunay refinement scheme is proposed. It generates an isotropic tetrahedral mesh corresponding to a sizing function which can be either user-specified or automatically derived from the input CDT. The quality of the produced meshes is guaranteed, i.e., most output tetrahedra have their circumradius-to-shortest-edge ratios bounded except those in the neighborhood of small input angles. Good mesh conformity can be obtained for smoothly changing sizing information. The algorithm has been implemented. Various examples are provided to illustrate its theoretical aspects as well as practical performance.
  • Thumbnail Image
    Item
    TetGen, towards a quality tetrahedral mesh generator
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2013) Si, Hang
    TetGen is a C++ program for generating quality tetrahedral meshes aimed to support numerical methods and scientific computing. It is also a research project for studying the underlying mathematical problems and evaluating algorithms. This paper presents the essential meshing components developed in TetGen for robust and efficient software implementation. And it highlights the state-of-the-art algorithms and technologies currently implemented and developed in TetGen for automatic quality tetrahedral mesh generation.
  • Thumbnail Image
    Item
    Tetrahedral mesh improvement using moving mesh smoothing and lazy searching flips
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2016) Dassi, Franco; Kamenski, Lennard; Si, Hang
    In this paper we combine two new smoothing and flipping techniques. The moving mesh smoothing is based on the integration of an ordinary differential coming from a given functional. The lazy flip technique is a reversible edge removal algorithm to automatically search flips for local quality improvement. On itself, these strategies already provide good mesh improvement, but their combination achieves astonishing results which have not been reported so far. Provided numerical examples show that we can obtain final tetrahedral meshes with dihedral angles between 40° and 123°. We compare the new method with other publicly available mesh improving codes.