This article addresses the problem of managing Moving Objects Databases (MODs) which
capture the inherent imprecision of the information about the moving object's location at a …

We propose a strategy to decompose a polygon, containing zero or more holes,
into``approximately convex''pieces. For many applications, the approximately convex …

Cell biologists increasingly rely on computer-aided image analysis, allowing them to collect
precise, unbiased quantitative results. However, despite great progress in image processing …

The irregular strip packing problem is a combinatorial optimization problem that requires to
place a given set of two-dimensional polygons within a rectangular container so that no …

We apply the tensor train (TT) decomposition to construct the tensor product polynomial
chaos expansion (PCE) of a random field, to solve the stochastic elliptic diffusion PDE with …

We consider the following motion-planning problem: we are given mm unit discs in a simple
polygon with nn vertices, each at their own start position, and we want to move the discs to a …

We investigate the concept of a median among a set of trajectories. We establish criteria that
a “median trajectory” should meet, and present two different methods to construct a median …

We present a simple, efficient, and stable method for computing—with any desired precision—
the medial axis of simply connected planar domains. The domain boundaries are assumed …

The emergence of very large hierarchies that result from the increase in available data
raises many problems of visualization and navigation. On data sets of such scale, classical …

This paper presents a hybrid method for creating three‐dimensional shapes by sketching
silhouette curves. Given a silhouette curve, we approximate its medial axis as a set of line …