2016/06/03 by Darren Engwirda, Engwirda, Darren · 1 citation
Computer Science · Engineering · #Computational Engineering #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #FOS: Mathematics #Finance #Fluid Dynamics Simulations and Interactions #Mathematical Software (cs.MS) #Numerical Analysis (math.NA) #Robotic Path Planning Algorithms #and Science (cs.CE)
paper · pdf · doi:10.48550/arxiv.1606.01289
openalex publication_date 2016/06/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A Frontal-Delaunay refinement algorithm for mesh generation in piecewise\nsmooth domains is described. Built using a restricted Delaunay framework, this\nnew algorithm combines a number of novel features, including: (i) an\nunweighted, conforming restricted Delaunay representation for domains specified\nas a (non-manifold) collection of piecewise smooth surface patches and curve\nsegments, (ii) a protection strategy for domains containing curve segments that\nsubtend sharply acute angles, and (iii) a new class of off-centre refinement\nrules designed to achieve high-quality point-placement along embedded curve\nfeatures. Experimental comparisons show that the new Frontal-Delaunay algorithm\noutperforms a classical (statically weighted) restricted Delaunay-refinement\ntechnique for a number of three-dimensional benchmark problems.\n