From the zonotope construction to the Minkowski addition of convex polytopes
From MaRDI portal
Recommendations
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- Publication:4863381
- The linear inequalities set representation of Minkovski's sum for two polyhedrons
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
Cites work
- A note on hyperplane generation
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- Polynomial Equations and Convex Polytopes
- Reverse search for enumeration
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
Cited in
(27)- On the exact maximum complexity of Minkowski sums of polytopes
- Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
- Set operations and order reductions for constrained zonotopes
- RPI approximations of the mRPI set characterizing linear dynamics with zonotopic disturbances
- Dynamic output feedback robust model predictive control via zonotopic set-membership estimation for constrained quasi-LPV systems
- Closed-loop input design for guaranteed fault diagnosis using set-valued observers
- Maximum likelihood estimation in the -model
- scientific article; zbMATH DE number 48749 (Why is no real title available?)
- Input design for guaranteed fault diagnosis using zonotopes
- The Minkowski sum of a zonotope and the Voronoi polytope of the root lattice $ E_7$
- Efficient edge-skeleton computation for polytopes defined by oracles
- Optimal sequential multiclass diagnosis
- Hyperplane arrangements in \texttt{polymake}
- Computing topological zeta functions of groups, algebras, and modules. I
- Optimization via low-rank approximation for community detection in networks
- Real zeros of mixed random fewnomial systems
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
- Arrangements on parametric surfaces. II: Concretizations and applications
- When are first-order asymptotics adequate? A diagnostic
- Minimal representations of tropical rational functions
- Signed Minkowski decompositions of convex polygons into minimum simplices and factorization of max-plus functions
- Covering Minkowski sum boundary using points with applications
- A linear optimization oracle for zonotope computation
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
- A numerical approach to design control invariant sets for constrained nonlinear discrete-time systems with guaranteed optimality
- On the hardness of computing intersection, union and Minkowski sum of polytopes
- A linear equation for Minkowski sums of polytopes relatively in general position
This page was built for publication: From the zonotope construction to the Minkowski addition of convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643562)
