Pages that link to "Item:Q1042457"

The following pages link to On the exact maximum complexity of Minkowski sums of polytopes (Q1042457):

Displaying 20 items.

• The maximum number of faces of the Minkowski sum of two convex polytopes (Q309640) (← links)
• Maximal f-vectors of Minkowski sums of large numbers of polytopes (Q411394) (← links)
• A counterexample to the Hirsch conjecture (Q447933) (← links)
• Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums (Q507686) (← links)
• A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes (Q728499) (← links)
• Minkowski sums of monotone and general simple polygons (Q818692) (← links)
• Topological obstructions for vertex numbers of Minkowski sums (Q1003631) (← links)
• The Minkowski sum of a simple polygon and a segment (Q1007520) (← links)
• Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
• On the flatness of Minkowski sums (Q1847384) (← links)
• The Minkowski sum of simplices in 3-dimensional space. An analytical description (Q2248741) (← links)
• Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
• Minkowski complexes and convex threshold dimension (Q2363363) (← links)
• \(f\)-vectors of Minkowski additions of convex polytopes (Q2369928) (← links)
• Computing the Minkowski sum of prisms (Q2501117) (← links)
• The maximum number of faces of the Minkowski sum of three convex polytopes (Q2970414) (← links)
• On the Algorithmic Complexity of Minkowski's Reconstruction Theorem (Q3839902) (← links)
• Minkowski Complexity of Sets: An Easy Lower Bound (Q4575425) (← links)
• Approximate convex intersection detection with applications to width and Minkowski sums (Q5009560) (← links)
• Minkowski summands of cubes (Q6133384) (← links)