Delaunay triangulations in three dimensions with finite precision arithmetic (Q1195754): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-8396(92)90044-p / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2064008635 / rank | |||
Normal rank |
Latest revision as of 09:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Delaunay triangulations in three dimensions with finite precision arithmetic |
scientific article |
Statements
Delaunay triangulations in three dimensions with finite precision arithmetic (English)
0 references
18 January 1993
0 references
The authors propose a modified version of a known algorithm for Delaunay triangulation of a given set in three-space to insure correct topology in finite precision arithmetic. They prove that their algorithm satisfies a well defined notion of robustness (assuming, as the authors do, that one does not run into trouble computing 5-by-5 determinants; it would be better to check whether a fifth point is or is not in the circumsphere of a tetrahedron without using determinants).
0 references
algorithm
0 references
Delaunay triangulation
0 references
finite precision arithmetic
0 references
robustness
0 references
0 references