Delaunay refinement for piecewise smooth complexes (Q848856)

An algorithm to mesh a piecewise smooth complex (PSC) with Delaunay refinement without any constraint on input angles is presented. The algorithm guarantees homeomorphism between the input and the output, due to the topological ball property, as well as non-smooth features because it meshes the input curves and vertices with 1-complexes. A new definition of local feature size is proposed because the usual local feature size definitions fail to provide an upper bound on the number of repeated insertions triggered by the topological ball property violations. The new definition is a non trivial combination between two classical definitions, one based on the medial axis, which is used in meshing smooth surfaces, and the other based on the adjacency elements, which is used in polyhedral meshing. The new local feature size function has the property of being 1-Lipschitz and nonzero everywhere. Since, in the case of meshing smooth closed surfaces, it is hard to compute the local feature size at points in a PSC, a computable alternative for points on 1-faces is used in the first step of the algorithm to construct balls to protect the vertices and 1-faces before running a Delaunay refinement algorithm using the weighted Voronoi diagram. The algorithm is shown to terminate and guaranteed bounds on the aspect ratios, normal variation, and dihedral angles are also provided. The paper is very well written and detailed.