Speaker
Prof.
Justin Solomon
(MIT)
Description
In this lecture, we will see how convex optimization can be applied to problems in geometry processing, whose unknowns are typically associated to elements of a point cloud, graph, or mesh. We will show that geodesic computation, optimal transport, edge-preserving smooth-ing via total variation, and skinning weights computation reduce to finite-dimensional convex problems that can be tackled with standard solvers.
Author
Prof.
Justin Solomon
(MIT)