1 / 39

Discrete Laplace Operators for Polygonal Meshes Δ

Discrete Laplace Operators for Polygonal Meshes Δ. Marc Alexa Max Wardetzky TU Berlin U Göttingen. Laplace Operators. Continuous Symmetric, PSD, linearly precise, maximum principle Discrete (weak form) Cotan discretization [ Pinkall/Polthier,Desbrun et al.]

kirkan
Download Presentation

Discrete Laplace Operators for Polygonal Meshes Δ

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 Laplace Operatorsfor Polygonal MeshesΔ Marc Alexa Max Wardetzky TU Berlin U Göttingen

  2. Laplace Operators • Continuous • Symmetric, PSD, linearly precise, maximum principle • Discrete (weak form) • Cotandiscretization [Pinkall/Polthier,Desbrun et al.] • Linearly precise, PSD, symmetric, NO maximum principle • No discrete Laplace = smooth Laplace [Wardetzky et al.]

  3. Geometry Processing • Smoothing / fairing [Desbrun et al. ’99]

  4. Geometry Processing • Smoothing / fairing • Parameterization [Gu/Yau ’03]

  5. Geometry Processing • Smoothing / fairing • Parameterization • Mesh editing [Sorkine et al. ’04]

  6. Geometry Processing • Smoothing / fairing • Parameterization • Mesh editing • Simulation [Bergou et al. ’06]

  7. Polygon meshes

  8. Polygon meshes

  9. Polygon • Polygons are not planar • Not clear what surface the boundary spans • Integration of basis function unclear / slow

  10. Laplace on Polygon Meshes

  11. Laplace on Polygon Meshes • Triangulating the polygons?

  12. Laplace on Polygon Meshes • Goal: ‘cotan-like’ operator for polygons • Symmetric (weak form) • Linearly precise • Positive semidefinite (positive energies) • Reduces to cotan on all-triangle mesh

  13. Laplace as Area Gradient • Laplace flow = area gradient [Desbrun et al.] • Triangle • cotan

  14. Laplace as Area Gradient • Laplace flow = area gradient [Desbrun et al.] • Triangle • cotan

  15. Laplace as Area Gradient • Laplace flow = area gradient [Desbrun et al.] • Triangles • Same plane

  16. Laplace as Area Gradient • Laplace flow = area gradient [Desbrun et al.] • Flat polygon

  17. Non-planar polygons

  18. Non-planar polygons • Vector area x2 x1 x0 0

  19. Non-planar polygons • Properties of vector area • Projecting in direction yields largest planar polygon • Area is independent of choice of origin or orientation

  20. Non-planar polygons • Vector area gradient • Is in the plane of maximalprojection • As before, orthogonal to • Simply use cross product with a

  21. Non-planar polygons e1 e0 b0 0

  22. Non-planar polygons

  23. Non-planar polygons • Differences along oriented edges • “Co-boundary” operator

  24. Non-planar polygons

  25. Non-planar polygons

  26. Properties of • is symmetric by construction as • Consequently, L is symmetric

  27. Properties of • L is linearly precise

  28. Properties of • Is L PSD with only constants in kernel? • Co-boundary d behaves right • Kernel ofmay be too large • spans kernel of

  29. Main result • Laplace operator for any mesh • Symmetric, Linearly precise, PSD • Reduces to standard ‘cotan’ for triangles

  30. Implementation • Very simple! • For each face, compute • and (differences, sums of coordinates) • , , (matrix products) • from (SVD)

  31. Implementation • Write M into large sparse matrix M1 • M1 has dimension halfedges×halfedges • Build the d-matrices • Have dimension halfedges× vertices • Then L = dT M1d(weak form) • Strong form requires normalization by M0

  32. Smoothing

  33. Parameterization

  34. Parameterization

  35. Parameterization

  36. Planarization • Planarization

  37. Planarization

  38. Conclusions / Future work • Laplace operator all meshes • Symmetric, PSD,linear precision • Reduces to cotan • Make non-planar part geometric

More Related