[vtkusers] Points inside a Volume

[Alex Southern]

Hi,

I've asked a similar question here before but Im going to ask it again 
slightly differently.

Using VTK, What is the fastest way to find all points in a grid, (or all 
cubes if you think of it a another way),  that fit inside an arbitrary 
shaped volume of polydata?

I tried vtkEnclosedPoints, it works but its very slow. Someone did 
suggest to me using templates does this ring any bells?

Thanks
Alex