We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral graph partitioning to decide whether each tetrahedron is inside or out

VTK delaunay3D 实例 ,VTK库中的delaunay3D 来进行点云的三角化。-This example creates a tetrahedral mesh from unorganized points. The example uses the vtkDelaunay3D filter. The resulting mesh will be a solid convex hull of the original points. The example takes the po

一个新的合并方法，多重网格（在一个共同的坐标）在一个单一的拓扑正确的网。这种方法是基于约束Delaunay四面体化和图割优化-a new merging method of multiple meshes (in a common coordinate) into one single topologically correct mesh. This method is based on the constrained Delaunay tetrahedralization and graph