<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body bgcolor="#ffffff" text="#000000">
No replies? This is surely a fairly common thing to do?
<br>
<br>
I tried to find some clues maybe someone can help me develop it into
a solution...
<br>
<br>
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.
<br>
<br>
Does anyone use this algorithm and know if it can be bent to do my
bidding?
<br>
<br>
Cheers
<br>
Alex
<br>
<br>
Try for FREE VTK exporter for Sketchup<br>
<a href="http://vtkexport4sketchup.blogspot.com/">vtkexport4sketchup.blogspot.com/</a><br>
<br>
On 14/08/2010 14:28, Alex Southern wrote:
<blockquote cite="mid:4C667DF1.2080203@tml.hut.fi" type="cite">Hi,
<br>
<br>
I've asked a similar question here before but Im going to ask it
again slightly differently.
<br>
<br>
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?
<br>
<br>
I tried vtkEnclosedPoints, it works but its very slow. Someone did
suggest to me using templates does this ring any bells?
<br>
<br>
Thanks
<br>
Alex
<br>
</blockquote>
<br>
</body>
</html>