Carnegie Mellon
Department of Mathematical 

Alex Rand, Carnegie Mellon University

3D Delaunay Refinement of Sharp 3D Domains Without a Local Feature Size Oracle


Ruppert's algorithm and its variants generate suitable 2D conforming triangulations for the finite element method. Extensions of this approach to 3D often require a local feature size oracle to correctly mesh acute input angles. Alternatively, a Delaunay refinement algorithm is given which guarantees estimates on the local feature size eliminating the need for explicit computation of local feature size. Coupled with a simplified collar construction for protecting acute angles, this leads to a practical algorithm for quality 3D meshing. This algorithm has been implemented and several computational examples will be given.

TUESDAY, October 7, 2008
Time: 1:30 P.M.
Location: PPB 300