Abstract
The all-pairs closest points problem is discussed. A divide-and-conquer algorithm used to solve the problem is also presented. The algorithm works by recursively partitioning the set of points into two halves, then solving for the halves plus a strip in the middle.
| Original language | English (US) |
|---|---|
| Pages | 48-51 |
| Number of pages | 4 |
| Volume | 28 |
| No | 1 |
| Specialist publication | Dr. Dobb's Journal |
| State | Published - Jan 2003 |
ASJC Scopus subject areas
- Software
- Computer Networks and Communications