%0 Journal Article %J International Journal of Computational Geometry & Applications %D 2001 %T A point-placement strategy for conforming Delaunay tetrahedralization %A Mount, Dave %A Gable,C. W %X A strategy is presented to find a set of points that 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 Straight-Line Graph (PSLG) such that each triangle has a bounded circumradius, which may be of independent interest. %B International Journal of Computational Geometry & Applications %V 11 %P 669 - 682 %8 2001/// %G eng %N 6 %R 10.1142/S0218195901000699