We investigate ways in which an algorithm can improve its expected performance by fine-
tuning itself automatically with respect to an unknown input distribution D. We assume here …

We prove an Ω (d lg n/(lg lg n) 2) lower bound on the dynamic cell-probe complexity of
statistically oblivious approximate-near-neighbor search (ANN) over the d-dimensional …

We present several results about Delaunay triangulations (DTs) and convex hulls in
transdichotomous and hereditary settings:(i) the DT of a planar point set can be computed in …

Suppose we want to compute the Delaunay triangulation of a set P whose points are
restricted to a collection ℛ of input regions known in advance. Building on recent work by …

Traditional algorithms in computational geometry assume that the input points are given
precisely. In practice, data is usually imprecise, but information about the imprecision is often …

Grid generation for reservoir simulation must honor classical key constraints and be
boundary aligned such that control-volume boundaries are aligned with geological features …

This paper deals with the application of terrestrial laser scanner technology to the health
monitoring of a monument in the World Heritage List. Specifically, this monument is a …

We show that Delaunay triangulations and compressed quadtrees are equivalent structures.
More precisely, we give two algorithms: the first computes a compressed quadtree for a …

Detailed geometric models of the real world are in increasing demand. LiDAR data is
appropriate to reconstruct urban models. In urban scenes, the individual surfaces can be …

We propose a new algorithm to preprocess a set of n disjoint unit disks in O (n log n)
expected time, allowing to compute the Delaunay triangulation of a set of n points, one from …