Pages that link to "Item:Q1342092"

The following pages link to An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane (Q1342092):

Displaying 6 items.

• An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
• An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
• An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
• An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← 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)