An Analysis and Implementation of a Parallel Ball Pivoting Algorithm

Abstract

The problem of surface reconstruction from a set of 3D points given by their coordinates and\roriented normals is a difficult problem, which has been tackled with many different approaches.\rIn 1999, Bernardini and colleagues introduced a very elegant and efficient reconstruction method\rthat uses a ball pivoting around triangle edges and adds new triangles if the ball is incident\rto three points and contains no other points. This paper details an implementation and parallelization of this algorithm.