   About the accuracy of 3D Delaunay Triangulation
  Hello folks,currently, I'm trying to reconstruct a surface on a point cloud using the 3D variant of Delaunay Triangulation. I'm using this class of the VTK framework to perform the operation:http://www.vtk.org/doc/release/5.0/html/a01323.htmlMost interesting for me is the alpha parameter, as it limits the search radius for the triangle generation and therefore influences the accuracy of the approximation.About the point set, I know the following:- It only approximates the surface (safe for noise)- It was sampled on a 3D grid, meaning all points have a fixed distance from each other in a direction (xd, yd, zd).My questions are now as follows:- Knowing the information above, how do I select alpha to attain optimal accuracy?- How can I calculate the an estimate for the maximum error of approximation for an arbitrary point in the set?Thanks a lot!   
  What you are computing is called an "alpha-shape", which is described in this paper. Have you read it?