Fast triangulation of unordered point clouds This tutorial explains how to run a greedy surface triangulation algorithm on a PointCloud with normals, to obtain a triangle mesh based on projections of the local neighborhoods. An example of the method’s output can be seen here: Background: algorithm and parameters The method works by maintaining a list of points from which the mesh can be grown (“fr