Ef.cient Texture Mapping Using Minimum Cut

Author

Yue, Jun ; Jin, Wanjun ; Chen, Wenbin ; Shen, I-Fan

Author_Institution

Dept. of Comput. Sci. & Eng., Fudan Univ., Shanghai

fYear

2005

fDate

21-23 Sept. 2005

Firstpage

560

Lastpage

564

Abstract

In this paper, we present a method for texturing arbitrary surface using minimum cut algorithm. This method is a general texturing method, where the user provides a 3D mesh and a texture sample, and gets the textured mesh as the output. Our method is very simple. We repeatedly paste texture patches onto the surface, which is segmented from a sample image. If a certain patch overlaps a part of textured surface, we use minimum cut algorithm to find out a stitching path that makes this patch fit the textured surface. We repeat this process until the whole surface has been textured. As this method is a patch-by-patch method, the computation cost is much lower than many other methods

Keywords

computational geometry; image sampling; image segmentation; image texture; solid modelling; 3D mesh; arbitrary surface texturing; image segmentation; minimum cut algorithm; patch-by-patch method; texture mapping; Anisotropic magnetoresistance; Boundary conditions; Clustering algorithms; Computational efficiency; Costs; Dynamic programming; Information technology; Surface cracks; Surface fitting; Surface texture;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Information Technology, 2005. CIT 2005. The Fifth International Conference on

Conference_Location

Shanghai

Print_ISBN

0-7695-2432-X

Type

conf

DOI

10.1109/CIT.2005.103

Filename

1562711