To handle broken 3D models can be a very time consuming problem. Several methods aiming for automatic mesh repair have been presented in the recent years. This thesis gives an extensive evaluation of automatic mesh repair algorithms, presents a mesh repair pipeline and describes an implemented automatic mesh repair algorithm. The presented pipeline for automatic mesh repair includes three main steps: octree generation, surface reconstruction and ray casting. Ray casting is for removal of hidden objects. The pipeline also includes a pre processing step for removal of intersecting triangles and a post processing step for error detection. The implemented algorithm presented in this thesis is a volumetric method for mesh repair. It generates an octree in which data from the input model is saved. Before creation of the output, the octree data will be patched to remove inconsistencies. The surface reconstruction is done with a method called Manifold Dual Contouring. First new vertices are created from the information saved in the octree. Then there is a possibility to cluster vertices together for decimation of the output. Thanks to a special Manifold criterion, the output is guaranteedto be manifold. Furthermore the output will have sharp and clear edges and corners thanks to the use of Singular Value Decomposition during determination of the positions of the new vertices.