The following pages link to (Q4228431):
Displaying 9 items.
- Structured discrete shape approximation: theoretical complexity and practical algorithm (Q824342) (← links)
- Minimum-perimeter enclosures (Q963415) (← links)
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Self-approaching paths in simple polygons (Q2173458) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- An Experimental Study of Weighted k-Link Shortest Path Algorithms (Q3564306) (← links)
