Two algorithms for constructing a Delaunay triangulation (Q3883495)
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 3688715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two algorithms for constructing a Delaunay triangulation |
scientific article; zbMATH DE number 3688715 |
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
