1 / 12

Texture Mapping using Surface Flattening via Multi-Dimensional Scaling

Texture Mapping using Surface Flattening via Multi-Dimensional Scaling. G.Zigelman, R.Kimmel, N.Kiryati IEEE Transactions on Visualization and Computer Graphics 2002. Multidimensional scaling (MDS). The idea: compute the pairwise geodesic distances between the vertices of the mesh:

tevy
Download Presentation

Texture Mapping using Surface Flattening via Multi-Dimensional Scaling

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Texture Mapping using Surface Flattening via Multi-Dimensional Scaling G.Zigelman, R.Kimmel, N.Kiryati IEEE Transactions on Visualization and Computer Graphics 2002

  2. Multidimensional scaling (MDS) • The idea: compute the pairwise geodesic distances between the vertices of the mesh: • Now, find n points in R2, so that their distance matrix is as close as possible to M. q2 q1

  3. MDS – the math details We look for X’, such that || M’ – M || is as small as possible, where M’ is the Euclidean distances matrix for points xi’.

  4. MDS – the math details Ideally, we want: want to get rid of these

  5. MDS – the math details Trick: use the “magic matrix” J :

  6. MDS – the math details Cleaning the system:

  7. How to find X’ We will use the spectral decomposition of B:

  8. How to find X’ So we find X’ by throwing away the last nd eigenvalues

  9. Flattening results (Zigelman et al.)

  10. Flattening results (Zigelman et al.)

  11. Flattening results (Zigelman et al.)

  12. The end

More Related