A 3D Advancing-Front Delaunay Mesh Refinement Algorithm

05/03/2021
by   Shankar P. Sastry, et al.
0

I present a 3D advancing-front mesh refinement algorithm that generates a constrained Delaunay mesh for any piecewise linear complex (PLC) and extend this algorithm to produce truly Delaunay meshes for any PLC. First, as in my recently published 2D algorithm, I split the input line segments such that the length of the subsegments is asymptotically proportional to the local feature size (LFS). For each facet, I refine the mesh such that the edge lengths and the radius of the circumcircle of every triangular element are asymptotically proportional to the LFS. Finally, I refine the volume mesh to produce a constrained Delaunay mesh whose tetrahedral elements are well graded and have a radius-edge ratio less than some ω^* > 2/√(3) (except “near” small input angles). I extend this algorithm to generate truly Delaunay meshes by ensuring that every triangular element on a facet satisfies Gabriel's condition, i.e., its diametral sphere is empty. On an “apex” vertex where multiple facets intersect, Gabriel's condition is satisfied by a modified split-on-a-sphere (SOS) technique. On a line where multiple facets intersect, Gabriel's condition is satisfied by mirroring meshes near the line of intersection. The SOS technique ensures that the triangles on a facet near the apex vertex have angles that are proportional to the angular feature size (AFS), a term I define in the paper. All tetrahedra (except “near” small input angles) are well graded and have a radius-edge ratio less than ω^* > √(2) for a truly Delaunay mesh. The upper bounds for the radius-edge ratio are an improvement by a factor of √(2) over current state-of-the-art algorithms.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/04/2018

A 2D Advancing-Front Delaunay Mesh Refinement Algorithm

I present a generalization of Chew's first algorithm for Delaunay mesh r...
07/20/2020

Quadrilateral meshes for PSLGs

We prove that every planar straight line graph with n vertices has a con...
07/01/2020

On Designing GPU Algorithms with Applications to Mesh Refinement

We present a set of rules to guide the design of GPU algorithms. These r...
03/07/2019

Computing Three-dimensional Constrained Delaunay Refinement Using the GPU

We propose the first GPU algorithm for the 3D triangulation refinement p...
01/24/2020

Approximating Surfaces in R^3 by Meshes with Guaranteed Regularity

We study the problem of approximating a surface F in R^3 by a high quali...
04/25/2019

Finding Hexahedrizations for Small Quadrangulations of the Sphere

This paper tackles the challenging problem of constrained hexahedral mes...
06/03/2016

Conforming restricted Delaunay mesh generation for piecewise smooth complexes

A Frontal-Delaunay refinement algorithm for mesh generation in piecewise...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.