29 search results - page 2 / 6 » A note concerning the closest point pair algorithm |
GMP
2000
IEEE
13 years 9 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
PVLDB
2011
12 years 8 months ago
2011
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
FSTTCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...