The following pages link to (Q4736844):
Displaying 8 items.
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) (Q621930) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- On the geometric dilation of closed curves, graphs, and point sets (Q870424) (← links)
- Minimum dilation stars (Q871060) (← links)
- Geometric dilation of closed planar curves: New lower bounds (Q883237) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440) (← links)
- Dilation-Optimal Edge Deletion in Polygonal Cycles (Q5387748) (← links)
