We present a refined construction of hierarchical probabilistic partitions with novel
properties, substantially stronger than previously known. Our construction provides a family …

In the prize‐collecting geometric enclosure problem (pcgep), a set SS of points in the plane
is given, each with an associated benefit. The goal is to find a simple polygon PP with …

Given a set of $ n $ points in the Euclidean plane, the $ k $-MinSumRadius problem asks to
cover this point set using $ k $ disks with the objective of minimizing the sum of the radii of …

We study a variant of the geometric multicut problem, where we are given a set $\mathcal {P}
$ of colored and pairwise interior-disjoint polygons in the plane. The objective is to compute …

We study the following separation problem: Given a collection of colored objects in the
plane, compute a shortest" fence" $ F $, ie, a union of curves of minimum total length, that …

Schematic representations display data in a way that highlights certain properties at the cost
of being less accurate for other aspects of the data. They are an ubiquitous tool to explore …

Let P be a set of n points in the plane. We consider the problem of partitioning P into two
subsets P_1 P 1 and P_2 P 2 such that the sum of the perimeters of ch (P_1) CH (P 1) and …

We study the following separation problem: Given a collection of pairwise disjoint coloured
objects in the plane with k different colours, compute a shortest “fence” F, ie, a union of …

We study a natural extension to the well-known convex hull problem by introducing
multiplicity: if we are given a set of convex polygons, and we are allowed to partition the set …

We study the following separation problem: Given a collection of colored objects in the
plane, compute a shortest “fence” F, ie, a union of curves of minimum total length, that …