3D delaunay refinement of sharp domains without a local feature size oracle

Abstract

A practical incremental refinement algorithm for computing a quality, conforming Delaunay mesh of an arbitrary 3D piecewise linear complex is given. The algorithm allows small input angles and does not require the local feature size of the input to be computed before performing the refinement. Small input angles are protected with a new type of collar which is simpler to implement and analyze than previous approaches. The algorithm has been implemented and several computational examples are given.