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)|
|Number of pages||4|
|Specialist publication||Dr. Dobb's Journal|
|State||Published - Jan 1 2003|
ASJC Scopus subject areas
- Computer Networks and Communications