Pages that link to "Item:Q831714"
From MaRDI portal
The following pages link to A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714):
Displaying 5 items.
- Contributing vertices-based Minkowski sum computation of convex polyhedra (Q628213) (← links)
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums (Q2384604) (← 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 worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q6126717) (← links)