Mr. Lorensen, thank you for the response.<br><br>The documentation is a little bit terse about the underlying algorithm of the vtkContourFilter. I was able to confirm it is indeed marching triangles from this course note:<br>
<a href="http://www.inf.ed.ac.uk/teaching/courses/vis/lecture_notes/lecture7.pdf" target="_blank">http://www.inf.ed.ac.uk/teaching/courses/vis/lecture_notes/lecture7.pdf</a><br><br>And from a commented line in the source code:<br>
<a href="http://vtk.sourcearchive.com/documentation/5.0.4/vtkTriangle_8cxx-source.html" target="_blank">http://vtk.sourcearchive.com/documentation/5.0.4/vtkTriangle_8cxx-source.html</a><br><br>Nevertheless, thank you for the response.<br>
<br><div class="gmail_quote">On Thu, Oct 4, 2012 at 6:00 PM, Bill Lorensen <span dir="ltr"><<a href="mailto:bill.lorensen@gmail.com" target="_blank">bill.lorensen@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">I think you mean marching tetrahedra..<br>VTK's contour filter implements marching triangles.<br><br><br><div class="gmail_quote">
<div><div>On Thu, Oct 4, 2012 at 4:07 PM, Rifat Aras <span dir="ltr"><<a href="mailto:rifat.aras@gmail.com" target="_blank">rifat.aras@gmail.com</a>></span> wrote:<br>
</div></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div><div>Dear VTK users,<br><br>I am interested in comparing different triangulation techniques regarding their performance and surface quality outputs.<br>
<br>My focus will be on the "Marching Triangles" algorithm [1]. When I checked the literature, I saw papers stating that the MT algorithm being capable of creating higher quality triangles with lower computing resources compared to the Marching Cubes algorithm.<br>
<br>This being the case, the interesting thing is, I cannot see many MT implementations compared to the number of MC implementations. VTK is such an example.<br><br>Why the VTK does not have an MT implementation (or does it have?) ? Does the community think that implementing MT not worth the hassle?<br>
<br>Or let me ask the other way around, would you consider the implementation of the MT algorithm a valuable addition to the VTK?<br><br>Please let me know what do you think...<br><br>Best regards.<span><font color="#888888"><br>
<br>-- <br><div>Rifat Aras</div>
<div>PhD Candidate</div><div>Modeling, Simulation, and Visualization Engineering</div><div>Old Dominion University, Norfolk, VA, United States<br><br></div>[1] "Marching triangles: Delaunay implicit surface triangulation", A. Hilton, J. Illingworth, 1997
</font></span><br></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>
<br></blockquote></div><span><font color="#888888"><br><br clear="all"><br>-- <br>Unpaid intern in BillsBasement at noware dot com<br><br>
</font></span></blockquote></div><br><br clear="all"><br>-- <br><div>Rifat Aras</div><div>PhD Candidate</div><div>Modeling, Simulation, and Visualization Engineering</div><div>Old Dominion University, Norfolk, VA, United States</div>
<br>