loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Computer and Information Technology (CIT'05)
Ef.cient Texture Mapping Using Minimum Cut
Shanghai, China
September 21-September 23
ISBN: 0-7695-2432-X
ASCII Text
x 
 
Jun Yue, Wanjun Jin, Wenbin Chen, I-fan Shen, "Ef.cient Texture Mapping Using Minimum Cut," Computer and Information Technology, International Conference on, pp. 560-564, Fifth International Conference on Computer and Information Technology (CIT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/CIT.2005.103,
author = {Jun Yue and Wanjun Jin and Wenbin Chen and I-fan Shen},
title = {Ef.cient Texture Mapping Using Minimum Cut},
journal ={Computer and Information Technology, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2432-X},
pages = {560-564},
doi = {http://doi.ieeecomputersociety.org/10.1109/CIT.2005.103},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Information Technology, International Conference on
TI - Ef.cient Texture Mapping Using Minimum Cut
SN - 0-7695-2432-X
SP560
EP564
A1 - Jun Yue,
A1 - Wanjun Jin,
A1 - Wenbin Chen,
A1 - I-fan Shen,
PY - 2005
KW - null
VL - 0
JA - Computer and Information Technology, International Conference on
ER -
 
Jun Yue, Department of Computer Science and Engineering, Fudan University
Wanjun Jin, Department of Mathematics, Fudan University
Wenbin Chen, Department of Mathematics, Fudan University
I-fan Shen, Department of Mathematics, Fudan University

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.

Citation:
Jun Yue, Wanjun Jin, Wenbin Chen, I-fan Shen, "Ef.cient Texture Mapping Using Minimum Cut," cit, pp.560-564, Fifth International Conference on Computer and Information Technology (CIT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.