@article {15601,
	title = {A point-placement strategy for conforming Delaunay tetrahedralization},
	journal = {International Journal of Computational Geometry \& Applications},
	volume = {11},
	year = {2001},
	month = {2001///},
	pages = {669 - 682},
	abstract = {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.},
	doi = {10.1142/S0218195901000699},
	author = {Mount, Dave and Gable,C. W}
}
