We present a monotonic convolution for planar regions A and B bounded by line and circular arc segments. The Minkowski sum equals the union of the cells with positive crossing numbers in the arrangement of the convolution, as is the case for the kinetic convolution. The monotonic crossing number is bounded by the kinetic crossing number, and also by the maximum number of intersecting pairs of m...

The similarity of two convex polyhedra A and B may be calculated by evaluating the volume or mixed volume of their Minkowski sum over a specific set of relative orientations. The relative orientations are characterized by the fact that faces and edges of A and B are parallel as much as possible. For one of these relative orientations the similarity measure is optimal. In this article we propose...

Numerous properties of vector addition systems with states amount to checking the (un)boundedness of some selective feature (e.g., number of reversals, run length). Some of these features can be checked in exponential space by using Rackoff’s proof or its variants, combined with Savitch’s theorem. However, the question is still open for many others, e.g., reversal-boundedness. In the paper, we ...

We investigate the structure of the Minkowski sum of standard simplices in R. In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope. 2000 MSC: 52B05, 52B11, 05C07.

Let A be a finite nonempty set of integers. An asymptotic estimate of several dilates sum size was obtained by Bukh. The unique known exact bound concerns the sum |A + k ·A|, where k is a prime and |A| is large. In its full generality, this bound is due to Cilleruelo, Serra and the first author. Let k be an odd prime and assume that |A| > 8kk. A corollary to our main result states that |2 · A +...

Recently, Eisenbrand, Pach, Rothvoß, and Sopher studied the function M(m, n), which is the largest cardinality of a convexly independent subset of the Minkowski sum of some planar point sets P and Q with |P | = m and |Q| = n. They proved that M(m, n) = O(m2/3n2/3+m+n), and asked whether a superlinear lower bound exists for M(n, n). In this note, we show that their upper bound is the best possib...

Article history: Available online 17 July 2008

3 Proof of Theorem 1 9 3.1 Estimation of the g1 term. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2 Estimation of the g3 term. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.3 Estimation of the g2 term. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.4 Putting everything together. . . . . . . . . . . . . . . . . . . . . ....