Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Delaunay refinement"”.

  1. Parallel Delaunay Refinement and Space -Time Meshing

    A tetrahedron is acute if all its dihedral angles are less than 90°. Triangulations of three-dimensional domains with acute tetrahedra are useful in mesh generation. We give several constructions for tiling space with acute tetrahedra.

    uiuc Repository record for Parallel Delaunay Refinement and Space -Time Meshing (opens in a new tab)

  2. Three Novel Algorithms for Triangle Mesh Processing: Progressive Delaunay Refinement Mesh Generation, Mls-Based Scattered Data Interpolation and Constrained Centroid Voronoi-Based Quadrangulation

    The last problem I address in the thesis is the conversion of triangle meshes to quadrilateral meshes. Although triangle meshes are preferred in most of applications, quadrilateral meshes show more stability in scientific computation. Because most of acquisition and mesh generation methods result …

    uiuc Repository record for Three Novel Algorithms for Triangle Mesh Processing: Progressive Delaunay Refinement Mesh Generation, Mls-Based Scattered Data Interpolation and Constrained Centroid Voronoi-Based Quadrangulation (opens in a new tab)

  3. Parallel Two-Dimensional Unstructured Anisotropic Delaunay Mesh Generation for Aerospace Applications

    … of point-insertion, triangulation, and Delaunay refinement. Applications focusing on high-lift design or dynamic stall, or numerical methods and modeling test cases focus on two-dimensional domains. This push-button parallel mesh generation approach can generate high-fidelity …

    odu Repository record for Parallel Two-Dimensional Unstructured Anisotropic Delaunay Mesh Generation for Aerospace Applications (opens in a new tab)

  4. Tetrahedral Mesh Improvement, Algorithms and Experiments

    … appearance of slivers in large three-dimensional Delaunay meshes has been reported as early as 1985. They persist even after treatment with the Delaunay refinement algorithm. Cheng et al. proposed to remove slivers by assigning real weights to the points and change the Delaunay to the weighted …

    uiuc Repository record for Tetrahedral Mesh Improvement, Algorithms and Experiments (opens in a new tab)