Pages that link to "Item:Q1822960"
From MaRDI portal
The following pages link to Finding minimal convex nested polygons (Q1822960):
Displaying 19 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)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- One approach to constructing a minimal convex hull (Q1759118) (← 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)
- Deconstructing approximate offsets (Q1930550) (← links)
- Sparse convex hull coverage (Q2230408) (← links)
- Fixed points of the EM algorithm and nonnegative rank boundaries (Q2338932) (← links)
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
- Analytical enclosure of the set of solutions of the three-species multivariate curve resolution problem (Q2676687) (← links)
- Finding the smallest triangles containing a given convex polygon (Q3697817) (← links)
- (Q4284244) (← links)
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS (Q4682203) (← links)
- Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons (Q5025050) (← links)
- On the complexity of approximating and illuminating three-dimensional convex polyhedra (Q5057423) (← links)
- Nonnegative Matrix Factorization Requires Irrationality (Q5283249) (← links)
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS (Q5291404) (← links)
