[vtkusers] Points inside a Volume

[Alex Southern]

  No replies? This is surely a fairly common thing to do?

I tried to find some clues maybe someone can help me develop it into a 
solution...

I read about the marching cubes algorithm, this begins with a definition 
of a 3d grid of cubes whose 8 corners are tested against the volume of 
interest.

Does anyone use this algorithm and know if it can be bent to do my bidding?

Cheers
Alex

Try for FREE VTK exporter for Sketchup
vtkexport4sketchup.blogspot.com/ <http://vtkexport4sketchup.blogspot.com/>

On 14/08/2010 14:28, Alex Southern wrote:
> 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

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.vtk.org/pipermail/vtkusers/attachments/20100815/e5d0c79d/attachment.htm>