2013年12月12日星期四

neighbor search problem

When I implementing the Volume relaxation, I need to solve neighbor search problem, I use Grid search algorithm to accomplish the job. 
The neighbour search finds the neighbours of all particles in a particular grid cell.  All neighbouring particles must be contained in the current or one of the maximal 26 adjacent cells to speed up the search.

没有评论:

发表评论