TY - JOUR
AB - This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are co-planar, It also presents an algorithm that in O(n log n) time constructs a tetrahedrization of a set of n points consisting of at most 3n-11 tetrahedra.
AU - Edelsbrunner, Herbert
AU - Preparata, Franco
AU - West, Douglas
ID - 4060
IS - 3-4
JF - Journal of Symbolic Computation
SN - 0747-7171
TI - Tetrahedrizing point sets in three dimensions
VL - 10
ER -