Delaunay graphs are almost as good as complete graphs (Q584279): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992847 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031874971 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Delaunay graphs are almost as good as complete graphs |
scientific article |
Statements
Delaunay graphs are almost as good as complete graphs (English)
0 references
1990
0 references
Let S be a set of N points in the plane and let DT(S) be the graph of the Delaunay triangulation of S. For all points a and b of S, let d(a,b) be the Euclidean distance from a to b and let DT(a,b) be the length of the shortest path in DT(S) from a to b. We show that there is a constant c \((\leq ((1+\sqrt{5})/2)\pi \approx 5.08)\) independent of S and N such that \(\frac{DT(a,b)}{d(a,b)}<c.\)
0 references
Delaunay triangulation
0 references
Euclidean distance
0 references
shortest path
0 references
