On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions

Vineet Sangar, Victor I. Lesk, Arthur M. Lesk

Research output: Contribution to journalArticlepeer-review

Abstract

In designing an algorithm to find pairs of points that are within Euclidean distance d it is effective to use a screening procedure to reject most pairs of points that are far apart. A procedure based on multiple, overlapping lattices can efficiently identify close points and exclude distant ones.

Original languageEnglish (US)
Pages (from-to)212-214
Number of pages3
JournalComputational Biology and Chemistry
Volume32
Issue number3
DOIs
StatePublished - Jun 2008

All Science Journal Classification (ASJC) codes

  • Structural Biology
  • Biochemistry
  • Organic Chemistry
  • Computational Mathematics

Fingerprint Dive into the research topics of 'On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions'. Together they form a unique fingerprint.

Cite this