Related papers: Tolerance Analysis by Polytopes
Zonotopes are widely used for over-approximating forward reachable sets of uncertain linear systems for verification purposes. In this paper, we use zonotopes to achieve more scalable algorithms that under-approximate backward reachable…
Consider a set of $r$ convex $d$-polytopes $P_1,P_2,...,P_r$, where $d\ge{}3$ and $r\ge{}2$, and let $n_i$ be the number of vertices of $P_i$, $1\le{}i\le{}r$. It has been shown by Fukuda and Weibel that the number of $k$-faces of the…
We establish Central Limit Theorems for the volumes of intersections of $B_{p}^n$ (the unit ball of $\ell_p^n$) with uniform random subspaces of codimension $d$ for fixed $d$ and $n\to \infty$. As a corollary we obtain higher order…
We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
This article describes the theoretical foundation of and explicit algorithms for a novel approach to morphology and anisotropy analysis of complex spatial structure using tensor-valued Minkowski functionals, the so-called Minkowski tensors.…
The Minkowski tensors are valuations on the space of convex bodies in ${\mathbb R}^n$ with values in a space of symmetric tensors, having additional covariance and continuity properties. They are extensions of the intrinsic volumes, and as…
In this paper we investigate the intersection problem for $1$-surfaces immersed in a complete Riemannian three-manifold $P$ with Ricci curvature bounded from below by $-2$. We first prove a Frankel's type theorem for $1$-surfaces with…
For a quantum particle with a single degree of freedom, we derive preparational sum and product uncertainty relations satisfied by $N$ linear combinations of position and momentum observables. The state-independent bounds depend on their…
In this article we carry out a detailed investigation of the geometric nature of the points at infinity of Minkowski superspace. It turns out that there are several sets of points forming the superconformal boundary of Minkowski superspace:…
In the Minkowski space, we consider a compact, spacelike hypersurface with boundary, which can be written as a graph on a spacelike hyperplane. We prove that, if its $k$-th mean curvature is constant, and its boundary is on the hyperplane…
The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…
In convex geometry, the Shapley-Folkman Lemma asserts that the nonconvexity of a Minkowski sum of $n$ dimensional bounded nonconvex sets does not accumulate once the number of summands exceeds the dimension $n$, and thus the sum becomes…
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct applications in the…
The main result of this paper is that the polytope of the bipartite TSP is significantly different from that of the general TSP. Comb inequalities are known as facet defining ones in the general case. In the bipartite case, however, many of…
In this paper we use a generating function approach to record and calculate entries of the Minkowski tensors of a polytope. We focus on ''surface tensors'', extending the methods used in arXiv:1807.10258 for moments of the uniform…
Minkowski tensors, also known as tensor valuations, provide robust $n$-point information for a wide range of random spatial structures. Local estimators for point clouds, e.g., representing voxelized data, however, are unavoidably biased…
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with…
We study a class of semialgebraic convex bodies called discotopes. These are instances of zonoids, objects of interest in real algebraic geometry and random geometry. We focus on the face structure and on the boundary hypersurface of…