The Minkowski sum of simplices in 3-dimensional space. An analytical description
From MaRDI portal
Publication:2248741
DOI10.1016/J.COMGEO.2014.04.002zbMATH Open1364.52008OpenAlexW207416463MaRDI QIDQ2248741FDOQ2248741
Authors: Jean-Paul Bourrieres 
Publication date: 27 June 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.04.002
Recommendations
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10)
Cites Work
- Title not available (Why is that?)
- A control problem for affine dynamical systems on a full-dimensional polytope.
- Easily Computable Facets of the Knapsack Polytope
- The number of faces of a simplicial convex polytope
- Title not available (Why is that?)
- \(f\)-vectors of Minkowski additions of convex polytopes
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- Title not available (Why is that?)
- The numbers of faces of simplicial polytopes
- On Minkowski sums of simplices
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- Optimal control of sampled-data piecewise affine systems
- Computing the Minkowski sum of prisms
- Cephoids: Minkowski sums of de Gua simplexes
- Combinatorial face enumeration in convex polytopes
- A production-transportation problem with piecewise linear cost structures
Cited In (2)
This page was built for publication: The Minkowski sum of simplices in 3-dimensional space. An analytical description
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248741)
