Skip to main content
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.

Lexicographical Manipulations for Correctly Computing Regular Tetrahedralizations With Incremental Topological Flipping

Published

Author(s)

Javier Bernal

Abstract

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.
Citation
- 6335
Report Number
6335

Keywords

delaumay triangulation, incremental topological flipping, power diagram, regular triangulation, Voronol diagram

Citation

Bernal, J. (1999), 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 June 16, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created June 1, 1999, Updated November 10, 2018