ACM Home Page
Please provide us with feedback. Feedback
Large mesh deformation using the volumetric graph Laplacian
Full text PdfPdf (1.81 MB)
Source ACM Transactions on Graphics (TOG) archive
Volume 24 ,  Issue 3  (July 2005) table of contents
Proceedings of ACM SIGGRAPH 2005
SESSION: Mesh manipulation table of contents
Pages: 496 - 503  
Year of Publication: 2005
ISSN:0730-0301
Also published in ...
Authors
Kun Zhou  Microsoft Research Asia
Jin Huang  Zhejiang University
John Snyder  Microsoft Research
Xinguo Liu  Microsoft Research Asia
Hujun Bao  Zhejiang University
Baining Guo  Microsoft Research Asia
Heung-Yeung Shum  Microsoft Research Asia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 166,   Citation Count: 37
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1073204.1073219
What is a DOI?

ABSTRACT

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's interior; its edges simply connect nearby points in the volume. This graph's 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's potential with several examples.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Alexa, M. 2003. Differential coordinates for local mesh morphing and deformation. The Visual Computer 19, 2, 105--114.
3
 
4
 
5
Botsch, M., and Kobbelt, L. 2003. Multiresolution surface representation based on displacement volumes. Computer Graphics Forum 22, 3.
6
7
 
8
Bridson, R., Teran, J., Molino, N., and Fedkiw, R. 2004. Adaptive physics based tetrahedral mesh generation using level sets. Engineering with Computers, to appear.
 
9
Chung, F. R. K. 1997. Spectral graph theory. CBMS 92, AMS.
10
11
 
12
 
13
14
 
15
Fujiwara, K. 1995. Eigenvalues of laplacians on a closed riemannian manifold and its nets. In Proceedings of AMS 123, 2585--2594.
 
16
 
17
18
19
 
20
21
22
 
23
Kobbelt, L., Bareuther, T., and Seidel, H.-P. 2000. Multiresolution shape deformations for meshes with dynamic vertex connectivity. Computer Graphics Forum 19, 3, 249--260.
 
24
25
 
26
Meyer, M., Desbrun, M., Schröder, P., and Barr, A. 2002. Discrete differential-geometry operators for triangulated 2-manifolds. In Proc. VisMath.
27
 
28
Owen, S. J. 1998. A survey fo unstructured mesh generation technology. In 7th International Mehsing Roundtable, 239--267.
29
30
 
31
32
33
34
35
36
37
38
 
39
 
40

CITED BY  41

Collaborative Colleagues:
Kun Zhou: colleagues
Jin Huang: colleagues
John Snyder: colleagues
Xinguo Liu: colleagues
Hujun Bao: colleagues
Baining Guo: colleagues
Heung-Yeung Shum: colleagues