An Implementation and Parallelization of the Scale Space Meshing Algorithm
Julie Digne
→ BibTeX
    title   = {{An Implementation and Parallelization of the Scale Space Meshing Algorithm}},
    author  = {Digne, Julie},
    journal = {{Image Processing On Line}},
    volume  = {5},
    pages   = {282--295},
    year    = {2015},
    doi     = {10.5201/ipol.2015.102},
% if your bibliography style doesn't support doi fields:
    note    = {\url{}}
Julie Digne, An Implementation and Parallelization of the Scale Space Meshing Algorithm, Image Processing On Line, 5 (2015), pp. 282–295.

Communicated by Pascal Monasse
Demo edited by Pascal Monasse


Creating an interpolating mesh from an unorganized set of oriented points is a difficult problemwhich is often overlooked. Most methods focus indeed on building a watertight smoothed meshby defining some function whose zero level set is the surface of the object. However in some casesit is crucial to build a mesh that interpolates the points and does not fill the acquisition holes:either because the data are sparse and trying to fill the holes would create spurious artifactsor because the goal is to explore visually the data exactly as they were acquired without anysmoothing process. In this paper we detail a parallel implementation of the Scale-Space Meshingalgorithm, which builds on the scale-space framework for reconstructing a high precision meshfrom an input oriented point set. This algorithm first smoothes the point set, producing asingularity free shape. It then uses a standard mesh reconstruction technique, the Ball PivotingAlgorithm, to build a mesh from the smoothed point set. The final step consists in back-projecting the mesh built on the smoothed positions onto the original point set. The result ofthis process is an interpolating, hole-preserving surface mesh reconstruction.


Non-Reviewed Supplementary Materials

These files and information are provided by the authors and have not been reviewed.