REGTET, a Fortran 77 program for computing a regular tetrahedralization for a finite set of weighted points in $3-$dimensional space, is discussed. REGTET is based on an algorithm by Edelsbrunner and Shah for constructing regular tetrahedralizations with incremental topological flipping. At the start of the execution of REGTET a regular tetrahedralization for the vertices of an artificial cube that contains the weighted points is constructed. Throughout the execution the vertices of this cube are treated in the proper lexicographical manner so that the final tetrahedralization is correct.
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.