pith. sign in

arxiv: 1606.01289 · v2 · pith:XG7USF43new · submitted 2016-06-03 · 💻 cs.CG · cs.CE· cs.MS· cs.NA· math.NA

Conforming restricted Delaunay mesh generation for piecewise smooth complexes

classification 💻 cs.CG cs.CEcs.MScs.NAmath.NA
keywords restrictedalgorithmcurvedelaunaydomainspiecewisesmoothconforming
0
0 comments X
read the original abstract

A Frontal-Delaunay refinement algorithm for mesh generation in piecewise smooth domains is described. Built using a restricted Delaunay framework, this new algorithm combines a number of novel features, including: (i) an unweighted, conforming restricted Delaunay representation for domains specified as a (non-manifold) collection of piecewise smooth surface patches and curve segments, (ii) a protection strategy for domains containing curve segments that subtend sharply acute angles, and (iii) a new class of off-centre refinement rules designed to achieve high-quality point-placement along embedded curve features. Experimental comparisons show that the new Frontal-Delaunay algorithm outperforms a classical (statically weighted) restricted Delaunay-refinement technique for a number of three-dimensional benchmark problems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.