The following pages link to (Q4028874):
Displaying 14 items.
- On the stretch factor of Delaunay triangulations of points in convex position (Q621926) (← links)
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) (Q621930) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees (Q1194346) (← links)
- Beta-skeletons have unbounded dilation (Q1614068) (← links)
- An exact algorithm for the minimum dilation triangulation problem (Q1679486) (← links)
- Affine invariant triangulations (Q2065637) (← links)
- Dynamic proximity calculations for situation awareness (Q4651716) (← links)
- Generating sparse spanners for weighted graphs (Q5056089) (← links)
- Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity (Q5214990) (← links)
- Improved stretch factor of Delaunay triangulations of points in convex position (Q5918555) (← links)
- Self-stabilizing metric graphs (Q5920217) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)
