<div>I've had almost the same problem (refer to my post at <a onclick="return top.js.OpenExtLink(window,event,this)" href="http://public.kitware.com/pipermail/vtkusers/2007-April/090700.html" target="_blank">http://public.kitware.com/pipermail/vtkusers/2007-April/090700.html
</a><font color="#000000">). I got one response mentioning that using vtkImplicitModeller might help. I've been busy implementing other portions of my project and haven't tried the implicit modeller. Maybe you can try it and post a feedback as to whether it helped or not.
</font></div>
<div><font color="#000000">Also, I've search the net and an algorithm/software called NUAGES might help too. Again, I have not tried it myself, so if you decide to try it, please post back whether it was useful or not so that others would know too!
</font></div>
<div><font color="#000000"></font> </div>
<div><font color="#000000">good luck.</font></div>
<div><br><br> </div>
<div><span class="gmail_quote">On 6/13/07, <b class="gmail_sendername"><a href="mailto:dean.inglis@camris.ca">dean.inglis@camris.ca</a></b> <<a href="mailto:dean.inglis@camris.ca">dean.inglis@camris.ca</a>> wrote:</span>
<blockquote class="gmail_quote" style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">Hi,<br><br>I have tried the various polydata triangulation algorithms, but<br>can't find something that will work for my particular problem:
<br>a sequence of open (no loops) contours derived from<br>image segmentation of a 3D data set. The segmentation is<br>of a non-convex 3D surface, so each slice's contour can be<br>slightly curved (e.g. C shaped ) or even twisting (
e.g. S shaped).<br>The surface corresponds to the articulating surface of a bone.<br>As an example of an ideal simple case viewed overhead in<br>the x-z plane (contours are in the x-y plane):<br><br>y-x<br>|<br>z<br><br>slice j=i+1 (jN-1)-(jN-2)- ... -(j3)-(j2)-(j1)-(j0)
<br><br><br>slice i (i0)-(i1)-(i2)-(i3)- ... -(iN-2)-(iN-1)<br><br><br>where (*) represent vertices, slice i has iN vertices, while<br>the next slice j=i+1, has jN vertices. Connecting vertex (iN-1)<br>to vertex (j0) and vertex (jN-1) to vertex (i0) forms a
<br>closed polygon which can be triangulated. However,<br>if iN and jN different and the vertices have varying heights<br>in the y direction, filters such as vtkDelauney*D or vtkTriangleFilter<br>will not produce "correct" results. What would be optimal
<br>is to triangulate from the outsides in, generating multiple<br>triangle apexes at certain vertices. Is there anything in VTK<br>or available otherwise that would be suitable?<br><br>Dean<br><br>_______________________________________________
<br>This is the private VTK discussion list.<br>Please keep messages on-topic. Check the FAQ at: <a href="http://www.vtk.org/Wiki/VTK_FAQ">http://www.vtk.org/Wiki/VTK_FAQ</a><br>Follow this link to subscribe/unsubscribe:<br>
<a href="http://www.vtk.org/mailman/listinfo/vtkusers">http://www.vtk.org/mailman/listinfo/vtkusers</a><br></blockquote></div><br>