Skip to main content
Conference ProceedingsOPEN ACCESS

REGTET: A program for computing regular tetrahedralizations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2073 629-632
DOI: 10.1007/3-540-45545-0_72
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Bernal, J. (2001). REGTET: A program for computing regular tetrahedralizations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2073, pp. 629–632). Springer Verlag. https://doi.org/10.1007/3-540-45545-0_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free