We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
This paper presents a new interest points detector whose goal is to better catch visual attention than standard detectors. It is based on the generalization of Loy and Zelinsky tr...
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Minkowski’s second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowsk...
Christian Bey, Martin Henk, Matthias Henze, Eva Li...