Treffer: Texture mapping on 3D surfaces using clustering-based cutting paths

Title:
Texture mapping on 3D surfaces using clustering-based cutting paths
Source:
Computational methods in computer graphics and scientific visualisationInternational journal of computational science and engineering (Print). 3(1):71-79
Publisher Information:
Genève: Inderscience, 2007.
Publication Year:
2007
Physical Description:
print, 3/4 p
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computer Graphics Group/Visual System Lab (CGVSL), Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Tawain, Province of China
ISSN:
1742-7185
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19083924
Database:
PASCAL Archive

Weitere Informationen

Texture mapping is a common technique in computer graphics used to render realistic images. Our goal is to achieve distortion-free texture mapping on arbitrary 3D surfaces. To texture 3D models, we propose a scheme to flatten 3D surfaces into a 2D parametric domain. Our method does not require the 2D boundary of flattened surfaces to be stationary. The proposed method consists of three steps: (1) we find high distortion areas in a 2D parametric domain and find a cutting path over these areas, (2) we add virtual points to adaptively find the better parametric domain boundary instead of a predefined boundary and (3) we perform a well-known smoothing technique for better texture mapping. The proposed scheme can be efficiently realised by a linear system and yields interactive performance. Several experimental results for both genus-0 and non-genus-0 models are presented to verify the proposed scheme.