Triangular Mesh Processing for Surfaces based on Visualization Toolkit

In this paper, we elaborate several algorithms that provide solutions to some of the problems that will be encountered when applying visualization toolkit (VTK) for graphics processing. Employing the Laplacian smoothing algorithm to complete the mesh smoothing process, that algorithm represents each point in the mesh with its neighborhood center, decreasing noise in the point cloud data and facilitating surface reconstruction. With the method of edge collapsing, it is convenient to delete points and cells in the mesh, enabling faster mesh extraction, reducing the difficulty of model processing, and speeding up processing. We also expound algorithms for surface reconstruction with acquired point cloud data. These algorithms provide a solution to some problems that will be encountered in practical engineering, decreasing the complexity of graphics processing in some cases, improving speed, and lessening noise interference.