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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aurenhammer, F.: Power diagrams: properties, algorithms and applications. SIAM J. Comput. 16 (1987) 78–96
Bernal, J.: On the expected complexity of the 3—dimensional Voronoi diagram. NISTIR 4321 (1990)
Bernal, J.: Lexicographical manipulations for correctly computing regular tetrahedralizations with incremental topological flipping. NISTIR 6335 (1999)
Delaunay, B.: Sur la sphère vide. Bull. Acad. Sci. USSR (VII), Classe Sci. Mat. Nat. (1934) 793–800
Dwyer, R. A.: Higher-dimensional Voronoi diagrams in linear expected time. Discrete Comput. Geom. 6 (1991) 343–367
Edelsbrunner, H., Shah, N. R.: Incremental topological flipping works for regular triangulations. Algorithmica 15(3) (1996) 223–241
Guibas, L. J., Knuth, D. E., Sharir, M.: Randomized incremental construction of Delaunay and Voronoi diagrams. Springer-Verlag Lecture Notes in Computer Science 443 (1990) 414–431
Lawson, C. L.: Software for C 1 surface interpolation. Mathematical Software III, J. R. Rice (Ed.), Academic Press, New York (1977) 161–194
Lawson, C. L.: Properties of n-dimensional triangulations. Computer Aided Geometric Design 3 (1986) 231–246
Voronoi, G.: Nouvelles applications des paramètres continus à la théorie des formes quadratiques. J. Reine Angew. Math. 134 (1908) 198–287
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernal, J. (2001). REGTET: A Program for Computing Regular Tetrahedralizations. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science — ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45545-0_72
Download citation
DOI: https://doi.org/10.1007/3-540-45545-0_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42232-7
Online ISBN: 978-3-540-45545-5
eBook Packages: Springer Book Archive