PCR: A Geometric Cocktail for Triangulating Point Clouds Beautifully Without Angle Bounds
- New search for: Leitão, Gonçalo N. V.
- New search for: Gomes, Abel J. P.
- New search for: The Eurographics Association
|commercial customers||academic customers|
|All round price||€17.50||€4.50|
Type of media:Conference paper
Type of material:Electronic Resource
Reconstructing a triangulated surface from a point cloud through a mesh growing algorithm is a difficult problem, in largely because they use bounds for the admissible dihedral angle to decide on the next triangle to be attached to the mesh front. This paper proposes a solution to this problem by combining three geometric properties: proximity, co-planarity, and regularity; hence, the PCR cocktail. The PCR cocktail-based algorithm works well even for point clouds with non-uniform point density, holes, high curvature regions, creases, apices, and noise.