Conforming Restricted Delaunay Mesh Generation for Piecewise Smooth Complexes | Zendy

Darren Engwirda | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Conforming Restricted Delaunay Mesh Generation for Piecewise Smooth Complexes

Author(s) -

Darren Engwirda

Publication year - 2016

Publication title -

procedia engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.32

H-Index - 74

ISSN - 1877-7058

DOI - 10.1016/j.proeng.2016.11.024

Subject(s) - delaunay triangulation , chew's second algorithm , ruppert's algorithm , piecewise , bowyer–watson algorithm , benchmark (surveying) , constrained delaunay triangulation , mathematics , algorithm , point cloud , mesh generation , representation (politics) , manifold (fluid mechanics) , computer science , topology (electrical circuits) , artificial intelligence , combinatorics , mathematical analysis , finite element method , geology , structural engineering , mechanical engineering , politics , engineering , geodesy , law , political science

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research