Automated construction of low-resolution, texture-mapped, class-optimal meshes

In this paper, we present a framework for the groupwise processing of a set of meshes in dense correspondence. Such sets arise when modeling 3D shape variation or tracking surface motion over time. We extend a number of mesh processing tools to operate in a groupwise manner. Specifically, we present...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 18(2012), 3 vom: 18. März, Seite 434-46
1. Verfasser: Patel, Ankur (VerfasserIn)
Weitere Verfasser: Smith, William A P
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2012
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM214520862
003 DE-627
005 20231224023738.0
007 cr uuu---uuuuu
008 231224s2012 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2011.101  |2 doi 
028 5 2 |a pubmed24n0715.xml 
035 |a (DE-627)NLM214520862 
035 |a (NLM)22241283 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Patel, Ankur  |e verfasserin  |4 aut 
245 1 0 |a Automated construction of low-resolution, texture-mapped, class-optimal meshes 
264 1 |c 2012 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 28.06.2012 
500 |a Date Revised 13.01.2012 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a In this paper, we present a framework for the groupwise processing of a set of meshes in dense correspondence. Such sets arise when modeling 3D shape variation or tracking surface motion over time. We extend a number of mesh processing tools to operate in a groupwise manner. Specifically, we present a geodesic-based surface flattening and spectral clustering algorithm which estimates a single class-optimal flattening. We also show how to modify an iterative edge collapse algorithm to perform groupwise simplification while retaining the correspondence of the data. Finally, we show how to compute class-optimal texture coordinates for the simplified meshes. We present alternative algorithms for topologically symmetric data which yield a symmetric flattening and low-resolution mesh topology. We present flattening, simplification, and texture mapping results on three different data sets and show that our approach allows the construction of low-resolution 3D morphable models 
650 4 |a Journal Article 
700 1 |a Smith, William A P  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 18(2012), 3 vom: 18. März, Seite 434-46  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:18  |g year:2012  |g number:3  |g day:18  |g month:03  |g pages:434-46 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2011.101  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 18  |j 2012  |e 3  |b 18  |c 03  |h 434-46