Re: [Algorithms] N-body processing

[Pierre T. <p.t...@wa...>]

> I just use a hash table, and a simple modulus hash key(with the polyhedra
> indexes), no performance problems with this and very easy to
> implement(especially when you use STL:-). Objects are stored in an
unsorted
> linked list off each hash entry.
> I don't use the pair table for anything other than caching closest feature
> pairs to improve performance.

Thanks David - as always you provide useful answers.