{"id":151898,"date":"2005-08-01T00:00:00","date_gmt":"2005-08-01T00:00:00","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/large-mesh-deformation-using-the-volumetric-graph-laplacian\/"},"modified":"2018-10-16T19:55:40","modified_gmt":"2018-10-17T02:55:40","slug":"large-mesh-deformation-using-the-volumetric-graph-laplacian","status":"publish","type":"msr-research-item","link":"https:\/\/www.microsoft.com\/en-us\/research\/publication\/large-mesh-deformation-using-the-volumetric-graph-laplacian\/","title":{"rendered":"Large Mesh Deformation Using the Volumetric Graph Laplacian"},"content":{"rendered":"
\n

We present a novel technique for large deformations on 3D meshes using the volumetric graph Laplacian. We first construct a graph representing the volume inside the input mesh. The graph need not form a solid meshing of the input mesh\u2019s interior; its edges simply connect nearby points in the volume. This graph\u2019s Laplacian encodes volumetric details as the difference between each point in the graph and the average of its neighbors. Preserving these volumetric details during deformation imposes a volumetric constraint that prevents unnatural changes in volume. We also include in the graph points a short distance outside the mesh to avoid local self-intersections. Volumetric detail preservation is represented by a quadric energy function. Minimizing it preserves details in a least-squares sense, distributing error uniformly over the whole deformed mesh. It can also be combined with conventional constraints involving surface positions, details or smoothness, and efficiently minimized by solving a sparse linear system. We apply this technique in a 2D curve-based deformation system allowing novice users to create pleasing deformations with little effort. A novel application of this system is to apply nonrigid and exaggerated deformations of 2D cartoon characters to 3D meshes. We demonstrate our system\u2019s potential with several examples.<\/p>\n