A point-placement strategy for conforming Delaunay tetrahedralization

A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is novel because it imposes no angle restrictions on the input PLC. In the process, an algorithm is described that computes a planar conforming Delaunay triangulation of a Planar StraightLine Graph (PSLG) such that each triangle has a bounded circumradius, which may be of independent interest.

• Type: Conference
• Year: 2000
• Where: SODA
• Authors: Michael Murphy, David M. Mount, Carl W. Gable
• Keywords: Algorithms, Delaunay Tetrahedralization, Planar Conforming Delaunay, Planar StraightLine Graph, SODA 2000