Power diagrams: properties, algorithms and applications
SIAM Journal on Computing
Properties of n-dimensional triangulations
Computer Aided Geometric Design
Higher-dimensional Voronoi diagrams in linear expected time
Discrete & Computational Geometry
Randomized Incremental Construction of Delaunay and Voronoi Diagrams
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
| Hi-index | 0.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.