<div dir="ltr"><br>Hi Wen, <br>many thanks for your answer.<br><br>I've read about kDTree and wondered if the OcTree is better (I have a 3D image).<br>please detail (if you know) why KdTree is better than OcTree or the opposite ...<br>
<br>regarding my first q: <br>-------------------------<br>my data structure:<br>vtkPolyData <=> vtkFloatArray <=> Scalars<br><br>I'm searching for a method that divides the poly to regions (how do I insert the number of the required regions) and returns the indexes (vtkIdType) + its corresponding scalar (float) in each region. <br>
<br>How I can get this?<br><br>Best and thanks in advance.<br>Hila<br><br><br><br><div class="gmail_quote">On Sun, Apr 29, 2012 at 10:32 PM, Li, Wen <span dir="ltr"><<a href="mailto:wen-li@uiowa.edu" target="_blank">wen-li@uiowa.edu</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div style="word-wrap:break-word">
Hila,
<div><br>
</div>
<div>Is <span style="white-space:nowrap">vtkKdTreePointLocator::FindPointsWithinRadius going to help you?</span></div>
<div><span style="font-weight:bold;white-space:nowrap"><br>
</span></div>
<div><font face="Geneva, Arial, Helvetica, sans-serif"><span style="white-space:nowrap">You can exclude points within a specific
radius and the rest points on the surface are beyond that value.</span></font></div>
<div><font face="Geneva, Arial, Helvetica, sans-serif"><span style="white-space:nowrap"><br>
</span></font></div>
<div><font face="Geneva, Arial, Helvetica, sans-serif"><span style="white-space:nowrap">You are right about the point ids. neighboring
points could have very different point Ids.</span></font></div>
<div><font face="Geneva, Arial, Helvetica, sans-serif"><span style="white-space:nowrap"><br>
</span></font></div>
<div><font face="Geneva, Arial, Helvetica, sans-serif"><span style="white-space:nowrap">Good Luck,</span></font></div>
<div><font face="Geneva, Arial, Helvetica, sans-serif"><span style="white-space:nowrap">Wen</span></font></div>
<div><font face="Geneva, Arial, Helvetica, sans-serif"><span style="white-space:nowrap"><br>
</span></font></div>
<div>
<div><div><div class="h5">
<div>On Apr 29, 2012, at 2:21 PM, Hila Hiler wrote:</div>
<br>
</div></div><blockquote type="cite"><div><div class="h5">
<div dir="ltr">Hi All,<br>
<br>
I'd like to get some <b>distant points</b> on a surface (in this case, a head).<br>
How do I know what the distance value should be?<br>
<br>
Actually, in my program I use this type: vtkIdType and with a loop move on a vtkPolyData.<br>
I tried to guess a number (5000), presented the points on the surface but realized that even that those points look very close, their indexes are faraway from each other- so I guess that I don't have a clue about it :-)<br>
<br>
<br>
so, any idea how I should find indexes/points which are faraway from each other on a surface ?<br>
<br>
<br>
Thanks in advance.<br>
<br>
Hila <br>
</div></div></div>
_______________________________________________<br>
Powered by <a href="http://www.kitware.com" target="_blank">www.kitware.com</a><br>
<br>
Visit other Kitware open-source projects at <a href="http://www.kitware.com/opensource/opensource.html" target="_blank">
http://www.kitware.com/opensource/opensource.html</a><br>
<br>
Please keep messages on-topic and check the VTK FAQ at: <a href="http://www.vtk.org/Wiki/VTK_FAQ" target="_blank">
http://www.vtk.org/Wiki/VTK_FAQ</a><br>
<br>
Follow this link to subscribe/unsubscribe:<br>
<a href="http://www.vtk.org/mailman/listinfo/vtkusers" target="_blank">http://www.vtk.org/mailman/listinfo/vtkusers</a><br>
</blockquote>
</div>
<br>
</div>
</div>
</blockquote></div><br></div>