Abstract. In a seminal STOC'95 paper, Arya et al. [4] devised a construction that for any set S of n points in Rd and any > 0, provides a (1 + )-spanner with diameter O(lo...
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
The Hausdorff distance is a measure defined between two point sets, here representing a model and an image. The Hausdorff distance is reliable even when the image contains multipl...