Description: 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 outside the original object. The reconstructed surface triangulation is the set of triangular
faces where inside and outside tetrahedra meet. Because the spectral partitioner makes local decisions based on
a global view of the model, it can ignore outliers, patch holes and undersampled regions, and surmount ambiguity
due to measurement errors. Our algorithm can optionally produce a manifold surface. We present empirical
evidence that our implementation is substantially more robust than several closely related surface reconstruction
programs. Platform: |
Size: 7606272 |
Author:madison |
Hits:
Description: This tool is a simplification of the ballpivoting algorithm. It imagines a bella eating a delaunay traignulation in order to extract a manifold surface.
It requires a single parameter: radius of the fretting ball.
Ball Fretting
Given a uniform sampled filled point cloud returns a tight triangulation.
Input:
■tetr: a set of tetraedrons, nx4 array. If the cloud is not tesselated yet you need to call a delaunay triangulator prior calling this function.
■p : nx3 array, 3D set of points.
■r : the only parameter of the algorithm, the radius of the fretting ball
Output:
■t : triangles ids, nx3 array
■tnorm: normals of triangles with outwards orientation Platform: |
Size: 851968 |
Author:tao lu |
Hits:
Search - point cloud surface delaunay