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 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 PSLG such that each triangle has a bounded circumradius, which may be of independent interest.