The greedy and Delaunay triangulations are not bad in the average case (Q1069709): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on Delaunay and optimal triangulations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation / rank | |||
Normal rank | |||
Latest revision as of 09:45, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The greedy and Delaunay triangulations are not bad in the average case |
scientific article |
Statements
The greedy and Delaunay triangulations are not bad in the average case (English)
0 references
1986
0 references
computational geometry
0 references
minimum weight triangulation
0 references
greedy algorithm
0 references
Voronoi diagram
0 references
point distribution
0 references
