IPL
2002
13 years 6 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
TALG
2008
13 years 6 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
CCCG
2008
13 years 8 months ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
SIGMOD
2000
ACM
13 years 11 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...