Pages that link to "Item:Q1822960"
From MaRDI portal
The following pages link to Finding minimal convex nested polygons (Q1822960):
Displayed 7 items.
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- An approximate algorithm for the minimal vertex nested polygon problem (Q1812727) (← links)
- Separation and approximation of polyhedral objects (Q1900992) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS (Q4682203) (← links)
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS (Q5291404) (← links)