<meta http-equiv="content-type" content="text/html; charset=utf-8"><div class="gmail_quote">On Thu, May 5, 2011 at 5:00 PM, agerlach <span dir="ltr"><<a href="mailto:agerlach@gmail.com">agerlach@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">Dang David. How come you always have a solution for my questions?<br>
<br>
I was hoping to find something that didn't require meshing points, but<br>
depending on how long that takes this may be a good solution. Do you have a<br>
recommendation of what class to use to mesh the output?<br>
<br>
Does your class interpolate the point scalars as well when sampling?<br>
<br>
Thanks...again<br>
Adam<br></blockquote><div><br></div><div>You could use this to mesh the output:</div><meta http-equiv="content-type" content="text/html; charset=utf-8"><a href="http://www.insight-journal.org/browse/publication/718">http://www.insight-journal.org/browse/publication/718</a><br clear="all">
<br></div><div class="gmail_quote">I don't believe the stratified sampling does any interpolation - the output is just points. You could do the interpolation yourself using something like this:</div><div class="gmail_quote">
<br></div><div class="gmail_quote"><meta http-equiv="content-type" content="text/html; charset=utf-8"><a href="http://www.vtk.org/Wiki/VTK/Examples/Cxx/DataStructures/vtkKdTree_BuildLocatorFromPoints_ClosestKPoints">http://www.vtk.org/Wiki/VTK/Examples/Cxx/DataStructures/vtkKdTree_BuildLocatorFromPoints_ClosestKPoints</a><br>
<br></div><div class="gmail_quote">to find a "neighborhood" of points and then weight their scalars according to the distance from the query point.</div><div class="gmail_quote"><br>David</div>