<div class="gmail_quote">On Thu, Aug 4, 2011 at 10:05 AM, Rackwitz, Karl <span dir="ltr"><<a href="mailto:Karl.Rackwitz@medizin.uni-leipzig.de">Karl.Rackwitz@medizin.uni-leipzig.de</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
Hey folks,<br>
<br>
i would appreciate it if someone could reassure my thoughts.<br>
<br>
I get points from an Surface-Scanner which are ordered in an nxm Array.<br>
Which is the fastest way of triangulating these points?<br>
<br>
Delaunay2D will take alot of time and i'm positive that a different approach is needed.<br>
Which would you suggest?<br>
<br>
1. Write an own specialized method depending on the indices?<br>
2. Use SurfaceReconstructionFilter?<br>
3. Use Polygon->Triangulate?<br>
<br>
I thank the person who shares some Knowledge or hints me in a direction.<br>
Cheers,<br>
<br>
Karl.<br></blockquote><div><br></div><div>Since your points are a grid, you can just insert them into the vtkPoints of a vtkStructuredData:</div><div><br></div><div><a href="http://www.vtk.org/Wiki/VTK/Examples/Cxx/StructuredGrid/StructuredGrid">http://www.vtk.org/Wiki/VTK/Examples/Cxx/StructuredGrid/StructuredGrid</a></div>
<div><br></div><div>If your points are not in a grid, you could use something like this:</div><div><a href="http://pointclouds.org/documentation/tutorials/greedy_projection.php#greedy-triangulation">http://pointclouds.org/documentation/tutorials/greedy_projection.php#greedy-triangulation</a></div>
<div><br></div><div>Most level set style methods (Poisson reconstruction, etc : <a href="http://www.midasjournal.org/browse/publication/718">http://www.midasjournal.org/browse/publication/718</a>) will not work well unless your shapes are complete objects (i.e. a scan from a single viewpoint won't work well).</div>
<div><br></div><div>Hope that helps,<br><br>David</div></div>