Triangular-Patch Based Texture Synthesis over Arbitrary Surfaces

We present an improved texture synthesis algorithm over arbitrary surfaces in this paper. The algorithm adopt the searching strategy of restriction degree to compute the texture coordinates of each triangular patch. It reduces the restrictive conditions as searching for the best matching patches and debases the complexity of the algorithm at the same time. Then aiming at the local boundary unmatching phenomenon, we find the best cut path between the overlap regions through extending graph cut technique. In particular, we combine the texture synthesis algorithm with illumination model to gain more natural effect. The results show that our solution fits to a wide range of sample textures and arbitrary surfaces.