Pages that link to "Item:Q1428113"
From MaRDI portal
The following pages link to A fast algorithm for approximating the detour of a polygonal chain. (Q1428113):
Displaying 13 items.
- Linear time algorithm for optimal feed-link placement (Q482338) (← links)
- On the geometric dilation of closed curves, graphs, and point sets (Q870424) (← links)
- Geometric dilation of closed planar curves: New lower bounds (Q883237) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Most finite point sets in the plane have dilation \(>1\) (Q2256585) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Lattice Spanners of Low Degree (Q2795942) (← links)
- Lattice spanners of low degree (Q2821117) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION (Q5297793) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890540) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890968) (← links)
