Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates

Algorithms

Tamal K. Dey¹ 

关键词: Delaunay refinement;    mesh generation;    piecewise-smooth complexes;    non-smoothness;    non-manifoldness;   

DOI  :  10.3390/a2041327

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY   
© 2009 by the authors; licensee Molecular Diversity Preservation International, Basel, Switzerland.