NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

REGTET: A Program for Computing Regular Tetrahedralizations

Published

Author(s)

Javier Bernal

Abstract

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.
Citation
- 6786
Report Number
6786
Pub Type
NIST Pubs

Download Paper

https://doi.org/10.6028/NIST.IR.6786

Keywords

delaunay triangulation, incremental topological flipping, power diagram, regular triangulation, voronoi diagram

Citation

Bernal, J. (2001), REGTET: A Program for Computing Regular Tetrahedralizations, - 6786, National Institute of Standards and Technology, Gaithersburg, MD, [online], https://doi.org/10.6028/NIST.IR.6786 (Accessed October 11, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created September 1, 2001, Updated November 10, 2018
Was this page helpful?