Related papers: Combinatorial Methods for Minkowski Tensors of Pol…
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 the natural tensor-valued generalizations of the intrinsic volumes of convex bodies. We prove two complete sets of integral geometric formulae, so called kinematic and Crofton formulae, for these Minkowski tensors.…
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 introduce surface Minkowski tensors to characterize rotational symmetries of shapes embedded in curved surfaces. The definition is based on a modified vector transport of the shapes boundary co-normal into a reference point which…
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…
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…
This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…
Minkowski sums cover a wide range of applications in many different fields like algebra, morphing, robotics, mechanical CAD/CAM systems ... This paper deals with sums of polytopes in a n dimensional space provided that both H-representation…
We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined)…
We propose a method to efficiently compute the Minkowski sum, denoted by binary operator $\oplus$ in the paper, of convex polytopes in $\Re^d$ using their face lattice structures as input. In plane, the Minkowski sum of convex polygons can…
It has been shown that local algorithms based on grey-scale images sometimes lead to asymptotically unbiased estimators for surface area and integrated mean curvature. This paper extends the results to estimators for Minkowski tensors. In…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
From Crofton's formula for Minkowski tensors we derive stereological estimators of translation invariant surface tensors of convex bodies in the n-dimensional Euclidean space. The estimators are based on one-dimensional linear sections. In…
This paper develops and compares algorithms to compute inner approximations of the Minkowski sum of convex polytopes. As an application, the paper considers the computation of the feasibility set of aggregations of distributed energy…
Signed Minkowski decomposition is an expression of a polytope as a Minkowski sum and difference of smaller polytopes. Signed Minkowski decompositions of a polytope can be interpreted as factorizations of a max-plus (tropical) function. We…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…
Minkowski tensors are comprehensive shape descriptors that robustly capture n-point information in complex random geometries and that have already been extensively applied in the Euclidean plane. Here, we devise a novel framework for…
Minkowski sums of simplices in ${\mathbb{R}}^n$ form an interesting class of polytopes that seem to emerge in various situations. In this paper we discuss the Minkowski sum of the simplices $\Delta_{k-1}$ in ${\mathbb{R}}^n$ where $k$ and…
A stationary Boolean model is the union set of random compact particles which are attached to the points of a stationary Poisson point process. For a stationary Boolean model with convex grains we consider a recently developed collection of…