Pages that link to "Item:Q1315417"
From MaRDI portal
The following pages link to A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes (Q1315417):
Displaying 18 items.
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
- Zonotopes and the LP-Newton method (Q833464) (← links)
- Smallest point of a polytope (Q1117135) (← links)
- Finding the closest point to the origin in the convex hull of a discrete set of points (Q1260737) (← links)
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane (Q1342092) (← links)
- Finding the projection on a polytope: An iterative method (Q1352784) (← links)
- A vertex algorithm for collision detection (Q1579473) (← links)
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← links)
- A simple projection algorithm for linear programming problems (Q1755785) (← links)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) (← links)
- The distance between convex sets with Minkowski sum structure: application to collision detection (Q2023661) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- Error bounds for solutions of linear equations and inequalities (Q4837939) (← links)
- (Q5054639) (← links)
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797) (← links)
- The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential (Q5230318) (← links)
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735) (← links)
