An optimal algorithm for realizing a Delaunay triangulation (Q287080)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal algorithm for realizing a Delaunay triangulation |
scientific article; zbMATH DE number 6585419
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for realizing a Delaunay triangulation |
scientific article; zbMATH DE number 6585419 |
Statements
An optimal algorithm for realizing a Delaunay triangulation (English)
0 references
26 May 2016
0 references
Delaunay triangulation
0 references
realizability
0 references
computational geometry
0 references
convex polygons
0 references
0 references
0.8608600497245789
0 references
0.8471226692199707
0 references
0.8471226692199707
0 references
0.8131890892982483
0 references
0.8050776124000549
0 references
