Two algorithms for constructing a Delaunay triangulation (Q3883495): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:10, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two algorithms for constructing a Delaunay triangulation |
scientific article |
Statements
Two algorithms for constructing a Delaunay triangulation (English)
0 references
1980
0 references
Delaunay triangulation
0 references
divide-and-conquer
0 references
Voronoi tessellation
0 references
computational geometry
0 references
analysis of algorithms
0 references
