Delaunay graphs are almost as good as complete graphs (Q584279): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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.\) | |||
| Property / review text: 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.\) / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C99 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4134086 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Delaunay triangulation | |||
| Property / zbMATH Keywords: Delaunay triangulation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Euclidean distance | |||
| Property / zbMATH Keywords: Euclidean distance / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
shortest path | |||
| Property / zbMATH Keywords: shortest path / rank | |||
Normal rank | |||
Revision as of 18:31, 1 July 2023
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
