18th International Meshing Roundtable
Salt Lake City, UT, USA.
October 25-28, 2009
Carnegie Mellon University
While several existing Delaunay refinement algorithms allow acute 3D piecewise
linear complexes as input, algorithms producing conforming Delaunay tetrahedralizations (as
opposed to constrained or weighted Delaunay tetrahedralizations) often involve cumbersome
constructions and are rarely implemented. We describe a practical construction for both "collar"
and "intestine"-based approaches to this problem. Some of the key ideas are illustrated
by the inclusion of the analogous 2D Delaunay refinement algorithms, each of which differs
slightly from the standard approach. We have implemented the 3D algorithms and provide
some practical examples.
Download Full Paper (PDF Format)
Contact author(s) or publisher for availability and copyright information on above referenced article