Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates

Abstract

Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly.

Keywords

• Delaunay refinement
• mesh generation
• piecewise-smooth complexes
• non-smoothness
• non-manifoldness