1. Iso-charts: Stretch-driven Mesh Parameterization using Spectral Analysis Kun Zhou, John Snyder*, Baining Guo, Heung-Yeung Shum Microsoft Research Asia Microsoft Research* Kun Zhou, John Snyder*, Baining Guo, Heung-Yeung Shum Microsoft Research Asia Microsoft Research*

2. Parameterizing Arbitrary 3D Meshes ChartificationTexture Atlas

3. Goals of Mesh Parameterization Large Charts Low Distortion

4. Iso-chart Algorithm Overview l Surface spectral analysis l Stretch optimization l Recursively split charts n until stretch criterion is met l Recursively split charts n until stretch criterion is met l Surface spectral clustering l Optimize chart boundaries Input: 3D mesh, user-specified stretch threshold Output: atlas having large charts with bounded stretch

5. IsoMapIsoMap Data points in high dimensional space [Tenenbaum et al, 2000] Data points in low dimensional space Neighborhood graph Analyze geodesic distance to uncover nonlinear manifold structure

6. Surface Spectral Analysis Geodesic Distance Distortion (GDD)

7. Surface Spectral Analysis Construct matrix of squared geodesic distances D N

8. Surface Spectral Analysis Perform centering and normalization to D N

9. Surface Spectral Analysis Perform eigenanalysis on B N to get embedding coords y i

10. GDD-minimizing Parameterization Parametric coordinates [Zigelman et al, 2002] Texture mapping l Produces triangle flips l Only handles single-chart (disk-topology) models

11. Stretch-minimizing Parameterization   2D texture domain surface in 3D linear map singular values: γ, Γ [Sander et al, 2001]

12. Stretch Optimization IsoMap, L 2 = 1.04, 2sIsoMap+Optimization, L 2 = 1.03, 6s [Sander01], L 2 = 1.04, 222s[Sander02], L 2 = 1.03, 39s

13. Surface Spectral Clustering Analysis Clustering

14. Surface Spectral Clustering l Get top n (≥ 3) eigenvalues/eigenvectors n where n maximizes l For each vertex n compute n-dimensional embedding coordinates l For each of the n dimensions n find two extreme vertices n set them as representatives l Remove representatives that are too close l Grow charts from representatives l Get top n (≥ 3) eigenvalues/eigenvectors n where n maximizes l For each vertex n compute n-dimensional embedding coordinates l For each of the n dimensions n find two extreme vertices n set them as representatives l Remove representatives that are too close l Grow charts from representatives

15. Surface Spectral Clustering n=3 n=4

16. Surface Spectral Clustering n=1: 2 charts n=2: 4 charts n=4: 8 charts n=3: 6 charts

17. Optimizing Partition Boundaries l create nonjaggy cut, through “crease” edges [Katz2003] l minimize embedding distortion

18. Optimizing Partition Boundaries Angular capacity alone [Katz et al, 2003] Distortion capacity aloneCombined capacity

19. Special Spectral Clustering l Avoid excessive partition for simple shapes n n n > 2 n = 2 1 st dimension n = 2 2 nd dimension n = 2 3 rd dimension l Special clustering for tabular shapes

20. Signal-Specialized Atlas Creation l Signal-specialized parameterization [Sander02] l Combine geodesic and signal distances geometry stretchsignal stretch

21. Implementation Details l Acceleration n Landmark IsoMap [Silva et al, 2003] n Only compute the top 10 eigenvalues l Acceleration n Landmark IsoMap [Silva et al, 2003] n Only compute the top 10 eigenvalues l Merge small charts as a post-process

22. Partition Process

23. ResultsResults 19 charts, L 2 =1.03, running time 98s, 97k faces

24. ResultsResults 38 charts, L 2 =1.07, running time 287s, 150k faces

25. ResultsResults 23 charts, L 2 =1.06, running time 162s, 112k faces

26. ResultsResults 11 charts, L 2 =1.01, running time 4s, 10k faces

27. ResultsResults 11 charts, L 2 =1.02, running time 90s, 90k faces

28. ResultsResults 6 charts, L 2 =1.03, running time 17s, 40k faces

29. Geometry Remeshing

30. Remeshing Comparison Original model [Sander03], 79.5dBIso-chart, 82.9dB

31. LOD Generation for Texture Synthesis 32x3264x64128x128

32. Texture Synthesis Results

34. Signal-Specialized Atlas Creation Original Geometry stretch SAE = 20.8 Signal param SAE = 17.9 Signal chart&param SAE = 16.5

35. Signal-Specialized Atlas Creation Original Geometry stretch SAE = 18.7 Signal param SAE = 11.5 Signal chart&param SAE = 9.7

36. ConclusionConclusion l Surface spectral analysis n for parameterization –provides good starting point for stretch minimization n for chartification –separates global features well –optimizes chart boundaries –yields special partition for tubular shapes l Surface spectral analysis n for parameterization –provides good starting point for stretch minimization n for chartification –separates global features well –optimizes chart boundaries –yields special partition for tubular shapes l Signal-specialized atlas creation l Iso-chart: a fast and effective atlas generator