An optimal algorithm for realizing a Delaunay triangulation (Q287080): 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.1016/s0020-0190(97)00071-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037540484 / rank | |||
Normal rank | |||
Latest revision as of 09:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for realizing a Delaunay triangulation |
scientific article |
Statements
An optimal algorithm for realizing a Delaunay triangulation (English)
0 references
26 May 2016
0 references
Delaunay triangulation
0 references
realizability
0 references
computational geometry
0 references
convex polygons
0 references
0 references
