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

Authors:
Vineet Sangar;Victor I. Lesk;Arthur M. Lesk
Affiliations:
Department of Biochemistry and Molecular Biology, and the Huck Institute for Genomics, Proteomics and Bioinformatics, The Pennsylvania State University, University Park, PA 16802, USA;Structural Bioinformatics Group, Biochemistry Building, Department of Biological Sciences, Imperial College, London SW7 2AY, United Kingdom;Department of Biochemistry and Molecular Biology, and the Huck Institute for Genomics, Proteomics and Bioinformatics, The Pennsylvania State University, University Park, PA 16802, USA
Venue:
Computational Biology and Chemistry
Year:
2008

Citing 2
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Calculations of a list of neighbors in molecular dynamics simulations

Journal of Computational Chemistry

Quantified Score

Hi-index	0.00

Visualization

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.