Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation (Q1256860): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4744064 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4144192 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5568974 / rank | |||
Normal rank | |||
Latest revision as of 01:02, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation |
scientific article |
Statements
Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation (English)
0 references
1979
0 references
triangulation of a planar point set
0 references
computational complexity
0 references
