Title

A Recursive Technique B ased on Splitting for Filling Holes in 3d Triangular Meshes

Abstract

Abstract

In computer graphics, triangular meshing is the most commonly used technique of representing 3d models. Recently, as the 3d scanners have been very popular, the problems coming with the representations are becoming more visible. One of the most popular problems is to repair the deformated areas that occur in a model scanning process. Currently, there exists several algorithms to fill holes in triangular meshes. While most of the algorithms are surface based algorithms that focus on directly creating a patch in the surface, there are also volume based hole filling algorithms that convert the input mesh to a grid and process into the cells of it. Although volume based algorithms guarantee robustness, they usually have lower performance. Surface based algorithms are faster but they are likely to lack robustness. In this thesis, we are proposing a surface based hole filling algorithm. Our algorithm mainly focuses on tracing the boundary vertices and creating small triangles that are close to the scale of the triangles of the original mesh. On contrary to most other algorithms, we do not apply any face refinement process and that makes our algorithm run faster. Also the splitting operation we apply helps us to get more robust output results.

Supervisor(s)

Supervisor(s)

OKAN METE

Date and Location

Date and Location

2022-09-02 10:00:00

Category

Category

MSc_Thesis