Mass partition problems describe the partitions we can induce on a family of measures or
finite sets of points in Euclidean spaces by dividing the ambient space into pieces. In this …

Half-space depth (also called Tukey depth or location depth) is one of the most commonly
studied data depth measures because it possesses many desirable properties for data …

Abstract Research in Moving Objects Databases (MOD) has addressed various aspects of
storing and querying trajectories of moving objects: from modelling, through linguistic …

We design efficient data structures for dynamically maintaining a ham-sandwich cut of two
point sets in the plane subject to insertions and deletions of points in either set. A ham …

Solving Polynomial Systems. Computing the solutions to systems of polynomial equations is
often called a fundamental problem in both computer algebra [23] and numerical algebraic …

The focus of this work is on maximizing the benefits of parallelization when processing some
queries over Spatial and Spatio-Temporal data by fusing the semantics of:(1) data itself; ie …