Computing correct Delaunay triangulations (Q1179540)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 24898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing correct Delaunay triangulations |
scientific article; zbMATH DE number 24898 |
Statements
Computing correct Delaunay triangulations (English)
0 references
26 June 1992
0 references
Technical questions about numerically stable computation of Delaunay triangulation and Voronoj diagram are investigated. The discussion is with respect to planar \(M\times M\) lattice where all generating points are supposed to be located. From \(M\) and underlying metrics \((L_ 1,L_ 2,L_ \infty)\) the necessary computer word length is derived. Correct and exact computations are possible for \(L_ \infty\) metric while for Euclidean \(L_ 2\) metric this technique is not successfully applicable.
0 references
Delaunay triangulation
0 references
Voronoj diagram
0 references
geometric optimization algorithms
0 references
numerically stable computer implementation
0 references
computational geometry
0 references
0.8193092346191406
0 references
0.8183269500732422
0 references
0.7932543158531189
0 references
0.7926914095878601
0 references
