We give a deterministic algorithm for triangulating a simple polygon in linear time. The basic
strategy is to build a coarse approximation of a triangulation in a bottom-up phase and then …

We introduce a new low-distortion embedding of l 2 d into l p O(log n) (p=1,2), called the
Fast-Johnson-Linden-strauss-Transform. The FJLT is faster than standard random projections …

Measuring the similarity between 3D shapes is a fundamental problem, with applications in
computer graphics, computer vision, molecular biology, and a variety of other fields. A …

We introduce a new low-distortion embedding of $\ell_2^d$ into $\ell_p^{O(\log n)}$ ($p=1,2$)
called the fast Johnson–Lindenstrauss transform (FJLT). The FJLT is faster than standard …

This paper uses a new formulation of the notion of duality that allows the unified treatment of
a number of geometric problems. In particular, we are able to apply our approach to solve …

The main contribution of this work is an O(n log n + k)-time algorithm for computing all k
intersections among n line segments in the plane. This time complexity is easily shown to be …

Let P be a simple polygon with N vertices, each being assigned a weight ∈ {0,1}, and let C,
the weight of P, be the added weight of all vertices. We prove that it is possible, in O(N) time, …

Measuring the similarity between 3D shapes is a fundamental problem, with applications in
computer vision, molecular biology, computer graphics, and a variety of other fields. A …

Discrepancy theory is the study of irregularities of distributions. A typical question is: given a
“complicated” distribution, find a “simple” one that approximates it well. As it turns out, many …

Givenn hyperplanes inE d , a (1/r)-cutting is a collection of simplices with disjoint interiors,
which together coverE d and such that the interior of each simplex intersects at mostn/r …