Related papers: Tolerance Analysis by Polytopes
General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the Minkowski sum boundary of $m$ arbitrary ellipsoids in $N$-dimensional Euclidean space. Expressions for the principal curvatures…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…
With respect to earlier investigations, the theory of multi-component, concentric, copolar, axisymmetric, rigidly rotating polytropes is improved and extended, including subsystems with nonzero density on the boundary and subsystems with…
We propose a method to outer bound forward reachable sets on finite horizons for uncertain nonlinear systems with polynomial dynamics. This method makes use of time-dependent polynomial storage functions that satisfy appropriate dissipation…
We consider the system of two material points that interact by elastic forces according to Hooke's law and their motion is restricted to certain curves lying on the plane. The nonintegrability of this system and idea of the proof are…
The article deals with operations defined on convex polyhedra or polyhedral convex functions. Given two convex polyhedra, operations like Minkowski sum, intersection and closed convex hull of the union are considered. Basic operations for…
Surgery, as developed by Browder, Kervaire, Milnor, Novikov, Sullivan, Wall and others is a method for comparing homotopy types of topological spaces with diffeomorphism or homeomorphism types of manifolds of dimension >= 5. In this paper,…
A function of a matrix is polyconvex when it can be expressed as a convex function of the matrix minors. Polyconvexity is a regularity condition ensuring existence of minimizers in nonlinear elasticity and, more broadly, in vectorial…
Gaussian processes can be considered as subsets of a standard Hilbert space, but the geometric understanding that would relate the size of a set with the size of its convex hull is still lacking. In this work, we adopt a geometric approach…
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
Under study are some vector optimization problems over the space of Minkowski balls, i.e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals;…
Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as…
We extend the scope of noncommutative geometry by generalizing the construction of the noncommutative algebra of a quotient space to situations in which one is no longer dealing with an equivalence relation. For these so-called tolerance…
Hilbert space frames generalize orthonormal bases to allow redundancy in representations of vectors while keeping good reconstruction properties. A frame comes with an associated frame operator encoding essential properties of the frame. We…
In this paper, we study Lorentzian hypersurfaces in Minkowski 5-space with non-diagonalizable shape operator whose characteristic polinomial is $(t-k_1)^2(t-k_3)(t-k_4)$ or $(t-k_1)^3(t-k_4)$. We proved that in these cases, a hypersurface…
The polytope containment problem is deciding whether a polytope is a contained within another polytope. This problem is rooted in computational convexity, and arises in applications such as verification and control of dynamical systems. The…