Sciweavers

Share
IPL
2002
125views more  IPL 2002»
9 years 9 months ago
A note concerning the closest point pair algorithm
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...
Martin Richards
TALG
2008
131views more  TALG 2008»
9 years 9 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
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...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
9 years 11 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
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 ...
David Eppstein
CCCG
2008
9 years 11 months ago
Data Structures for Range-Aggregate Extent Queries
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...
Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Mich...
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
10 years 2 months ago
Closest Pair Queries in Spatial Databases
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...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
books