1 / 6

Discrete Laplacian

Discrete Laplacian. Premiere Version (echauffement). Laplacien avec poids uniformes (formule slide suivant) Implanter un menu/raccourci avec une iteration, 10 ou 100 iterations. Des modeles (format off) se trouvent ici. valence(vertex). (implementation hint). int nbv = size_of_vertices();

ziven
Télécharger la présentation

Discrete Laplacian

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. Discrete Laplacian

  2. Premiere Version (echauffement) • Laplacien avec poids uniformes (formule slide suivant) • Implanter un menu/raccourci avec une iteration, 10 ou 100 iterations. • Des modeles (format off) se trouvent ici

  3. valence(vertex)

  4. (implementation hint) int nbv = size_of_vertices(); std::vector<Vector_3> dx(nbv); iterate on vertices dx[i] = Vector_3(0,0,0); // init circulate around current vertex ... // (compute displacements) iterate on vertices apply displacements

  5. Seconde Version Poids non uniforme (meilleure discretisation, cf lien) αij αji

  6. Filtrage bilateral • Implanter un algorithme similaire a cet article, cf http://people.csail.mit.edu/thouis/ • Tester sur d’autres modeles du repository

More Related