The closest pair of points problem or closest pair problem is a problem of computational geometry: given n points in metric space, find a pair ofâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Pegah Kamousi, Timothy M. Chan, Subhash Suri
- WADS
- 2011

Given a (master) set M of n points in d-dimensional Euclidean space, consider drawing a random subset that includes each point miâ€¦Â (More)

Is this relevant?

2006

2006

- Qi Ge, Haitao Wang, Hong Zhu
- Journal of Computer Science and Technology
- 2006

As early as in 1975, Shamos and Hoey first gave an O(n lg n)-time divide-and-conquer algorithm (SH algorithm in short) for theâ€¦Â (More)

Is this relevant?

2003

2003

- Jing Shan, Donghui Zhang, Betty Salzberg
- SSTD
- 2003

An important query for spatial database research is to find the closest pair of objects in a given space. Existing work assumesâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Antonio Corral, Yannis Manolopoulos, Yannis Theodoridis, Michael Vassilakopoulos
- SIGMOD Conference
- 2000

This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in aâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen
- J. Algorithms
- 1997

The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeledâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Julien Basch, Leonidas J. Guibas, Li Zhang
- Symposium on Computational Geometry
- 1997

A kinetic data structure for the maintenance of a multidi mensional range search tree is introduced This structure is used as aâ€¦Â (More)

Is this relevant?

1993

1993

We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this dataâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
- Discrete & Computational Geometry
- 1992

We apply Megiddo's parametric searching technique to several geometric optimization problems and derive significantly improveâ€¦Â (More)

Is this relevant?

1992

1992

- Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink
- Algorithmica
- 1992

We give an algorithm that computes the closest pair in a set of <italic>n</italic> points in <italic>k</italic>-dimensional spaceâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Cheong
- Discrete & Computational Geometry
- 1990

<italic>We present an algorithm to compute a Euclidean minimum spanning tree of a given set S of n points in</italicâ€¦Â (More)

Is this relevant?