Re: vmd-l: Fast routines for distance evaluations using PBC.

From: John Stone (
Date: Fri May 11 2007 - 13:15:27 CDT

A uniform grid should to work fine even for PBC, though the algorithm
for PBC requires doing wraparound on the grid cells. This is the strategy
I plan to implement for adding PBC handling in some of the internal VMD
routines for things like the "within" selection and so on.
Let me know if you need help with this.

  John Stone

On Fri, May 11, 2007 at 04:52:49PM +0000, Arturas Ziemys wrote:
> Hi,
> Does anybody know some routines/algorithms to make particle distance evaluation and/or selection faster than "brute-force" way recalculating those distances directly (using PBC)? One could use some things like KDTrees, but it is useless with PBC.
> Any clues would be welcome :) !
> Best
> Arturas Z.

NIH Resource for Macromolecular Modeling and Bioinformatics
Beckman Institute for Advanced Science and Technology
University of Illinois, 405 N. Mathews Ave, Urbana, IL 61801
Email:                 Phone: 217-244-3349
  WWW:      Fax: 217-244-6078

This archive was generated by hypermail 2.1.6 : Wed Feb 29 2012 - 15:44:40 CST