REGTET: A Program for Computing Regular Tetrahedralizations
Wednesday, February 27, 2002 15:00-16:00,
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.
Room 145, NIST North (820)
Wednesday, February 27, 2002 13:00-14:00,
Contact: A. J. Kearsley
Note: Visitors from outside NIST must contact
Robin Bickel; (301) 975-3668;
at least 24 hours in advance.