I want to prevent convex hull so delaunay doesnt fit my needs.<br><div class="gmail_quote"><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;"><br>
I tried the following pipeline:<br>
<br>
polyData -> vtkGaussianFilter OR vtkShepardMethod OR (vtk 5.0.1 doesnt contain vtkFastSplatter) -> vtkContourFilter OR vtkMarchingSquares OR vtkMarchingCubes<br>
<br>
The problem may result from having less number of points? For instance, i have 8 points which are corners of a polyhedron. Kevin, thanks for your interest and help.<br>
<br>
murat<br>
<br>
</blockquote><div><br>The best I have come up with is here:<br><br><a href="http://www.vtk.org/Wiki/Create_a_surface_from_Unorganized_Points">http://www.vtk.org/Wiki/Create_a_surface_from_Unorganized_Points</a><br><a href="http://www.vtk.org/Wiki/Create_a_surface_from_Unorganized_Points_%28Gaussian_Splat%29">http://www.vtk.org/Wiki/Create_a_surface_from_Unorganized_Points_%28Gaussian_Splat%29</a><br>
<br>This is a very commonly asked question on the list. Can anyone comment if the above two methods are the best VTK has to offer as far as creating a surface from a point cloud? I think the graphics community would claim that this is a "solved" problem - but the results still seem rather bad!<br>
<br>Murat - the MarchingCubes algorithm requires more than just the points - take a look at:<br><a href="http://www.vtk.org/Wiki/Create_models_from_labeled_volume_data_%28Discrete_MarchingCubes%29">http://www.vtk.org/Wiki/Create_models_from_labeled_volume_data_%28Discrete_MarchingCubes%29</a><br>
<br clear="all">Thanks,<br><br>David <br></div></div>