" From the publication of the first printing, in 1994, this book became one of the most widely
used textbooks in Discrete Geometry. The reviewer sees at least two reasons for that: the …

We first recall some basic definitions on widths (cf.[P] for more details). Let X be a real
complex normed linear space and A a closed, convex centrally symmetric subset of X. The n-…

At Bridges 2001, Zongker and Hart [8] gave a construction for “blending” two polyhedra using
an overlay of dual spherical nets. The resulting blend, they noted, is the Minkowski sum of …

The behaviour verification of hybrid systems, for example for safety properties, is based on
the computation of the reachable state space of a hybrid automaton modelling the system …

In this paper we propose a new technique for verification by simulation of continuous and
hybrid dynamical systems with uncertain initial conditions. We provide an algorithmic …

We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We
give expressions for the number of spanning trees, the number of Hamiltonian paths when …

In this paper we propose an original approach to the analysis of ranking data. The proposed
technique is based on the theory of the permutation sets. Dealing with untied ranking, the …

Testing is an important tool for validation of the system design and its implementation. Model-based
test generation allows to systematically ascertain whether the system meets its …

This paper presents an easy-to-implement and efficient method to calculate the Minkowski
Sums of simple convex objects. The method is based on direct manipulation of planes in 3D …

We study the dimension of “random” Euclidean sections of direct sums of normed spaces.
We compare the obtained results with results from , to show that for the direct sums the …