Two algorithms for constructing a Delaunay triangulation (Q3883495): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00977785 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002827932 / rank | |||
Normal rank | |||
Latest revision as of 11:38, 30 July 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
