Leitão, Gonçalo N. V.Gomes, Abel J. P.Jakob Andreas Bærentzen and Klaus Hildebrandt2017-07-022017-07-022017978-3-03868-047-51727-8384https://doi.org/10.2312/sgp.20171206https://diglib.eg.org:443/handle/10.2312/sgp20171206Reconstructing 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.Computing methodologies> Mesh modelsPointbased models10.2312/sgp.2017120611-12