The "all-pairs closest points" problem

Research output: Contribution to specialist publicationArticle

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 languageEnglish (US)
Pages48-51
Number of pages4
Volume28
No1
Specialist publicationDr. Dobb's Journal
StatePublished - Jan 1 2003

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'The "all-pairs closest points" problem'. Together they form a unique fingerprint.

  • Cite this