A fast algorithm for constructing Delaunay triangulations in the plane (Q3765247)
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: A fast algorithm for constructing Delaunay triangulations in the plane |
scientific article; zbMATH DE number 4022642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for constructing Delaunay triangulations in the plane |
scientific article; zbMATH DE number 4022642 |
Statements
A fast algorithm for constructing Delaunay triangulations in the plane (English)
0 references
1987
0 references
Delaunay triangulations
0 references
0.8756887316703796
0 references
0.8699853420257568
0 references
0.8639898896217346
0 references
0.8511386513710022
0 references
0.8486000299453735
0 references
