Some indecomposable polyhedra

DOI10.1080/02331930701617304zbMath1165.52012OpenAlexW1987402250MaRDI QIDQ5426970

David Yost

Publication date: 16 November 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/60368

zbMATH Keywords

polytopespolyhedraMinkowski sumdecomposable

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Three-dimensional polytopes (52B10)

Related Items (2)

Cephoids: Minkowski sums of de Gua simplexes ⋮ Extreme lower previsions

Cites Work

• Improvements to algorithms for computing the Minkowski sum of 3-polytopes
• The visibility-Voronoi complex and its applications
• Indecomposable convex polytopes
• Indecomposable polytopes
• Polyhedra with 4 to 8 faces
• Computing the Minkowski sum of prisms
• Accurate Minkowski sum approximation of polyhedral models
• Decomposable convex polyhedra

This page was built for publication: Some indecomposable polyhedra