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.<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