Two algorithms for constructing a Delaunay triangulation (Q3883495): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q105583229, #quickstatements; #temporary_batch_1711504539957 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q105583229 / rank | |||
Normal rank | |||
Revision as of 03:50, 27 March 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
