Lexicographical Manipulations for Correctly Computing Regular Tetrahedralizations With Incremental Topological Flipping
Edelsbrunner and Shah have proven that incremental topological flipping works for constructing a regular triangulation for a finite set of weighted points in d-dimensional space. This paper describes the lexicographical manipulations employed in a recently completed implementation of their method for correctly computing 3-dimensional regular triangulations. At the start of the execution of this implementation a regular triangulation for the vertices of an artificial cube that contains the points is constructed. Throughout the execution the vertices of this cube are treated in the proper lexicographical manner so that the final triangulation is correct.
Lexicographical Manipulations for Correctly Computing Regular Tetrahedralizations With Incremental Topological Flipping, - 6335, National Institute of Standards and Technology, Gaithersburg, MD, [online], https://doi.org/10.6028/NIST.IR.6335
(Accessed December 8, 2023)