PCR: A Geometric Cocktail for Triangulating Point Clouds Beautifully Without Angle Bounds

Abstract

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.