Robust and efficient bijective parameterization

The goal of this thesis was to create a novel algorithm for bijective parameterizations of 3D triangle meshes with disk topology. Existing methods are either fast, but create non-bijective parameterizations, or are too slow to be applied to bigger meshes like high-resolution 3D scans or video game levels. We show an approach to transform an arbitrary, potentially non-bijective parameterization into a bijective mapping. The results show that the new algorithm produces results that are at least competitive with existing bijective parameterizers and still has room for future improvements.