Synthesis Technology Triangle Mesh Texture Like Graph

Texture synthesis is one of the most active research topics in the present topics in the present fields of computer graphics, image processing and computer vision. It has broad application prospects in large-scale realistic scene rendering, computer animation, virtual reality. Texture Synthesis From Sample (TSFS) is a new texture synthesis technique developed in recent years. With the rapid development of three-dimensional geometric digital media, there is an urgent need for an efficient technology of texture synthesis on the3D model. Texture can be used to show the details of surface of the3D model, so as to compensate for geometry drawn. Texture Synthesis From Sample provides a new way of thinking for synthesizing texture on surface of3D model. This paper aims to study TSFS technology on the surface of3D mesh model. Based on previous research efforts on TSFS, we present an algorithm of synthesizing texture on surface of3D model. We also extend the algorithm to2D texture by Delaunay triangulation. The algorithm can effectively avoid the distortion of the texture. It can be used for synthesizing texture on3D mesh, and can also be used for synthesizing2D plain texture directly.Firstly, this article gives a brief introduction on the texture synthesis technique and introduces some basic concepts of texture synthesis. Then it gives a general view of recent progresses on TSFS and several typical algorithms based on a sample image are present.Secondly, we describe our algorithm in detail. The algorithm is divided into two stages. The first stage is the preprocessing of the sample image, the second one is texture synthesis. The sample image is analysis in the first stage. In the second stage, the texture was synthesized block by block in a specified order until all the mesh is covered. The block is triangle patch. The order in which the triangle patch is synthesized is based on "constrain degree".Thirdly, the algorithm.of Delaunay triangulation is introduced in detail. The algorithm can be used to triangulate arbitrary planar polygon. In this way, we can extend our algorithm to2D texture in arbitrary planar region.