File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A fast multigrid algorithm for mesh deformation

TitleA fast multigrid algorithm for mesh deformation
Authors
KeywordsConstraints
Graph Hierarchy
Laplacian
Mesh Editing
Prolongation/Restriction Operators
Issue Date2006
Citation
ACM Siggraph 2006 Papers (Siggraph '06) in ACM Transactions on Graphics, 2006, v. 25 n. 3, p. 1108-1117 How to Cite?
AbstractIn this paper, we present a multigrid technique for efficiently deforming large surface and volume meshes. We show that a previous least-squares formulation for distortion minimization reduces to a Laplacian system on a general graph structure for which we derive an analytic expression. We then describe an efficient multigrid algorithm for solving the relevant equations. Here we develop novel prolongation and restriction operators used in the multigrid cycles. Combined with a simple but effective graph coarsening strategy, our algorithm can outperform other multigrid solvers and the factorization stage of direct solvers in both time and memory costs for large meshes. It is demonstrated that our solver can trade off accuracy for speed to achieve greater interactivity, which is attractive for manipulating large meshes. Our multigrid solver is particularly well suited for a mesh editing environment which does not permit extensive precomputation. Experimental evidence of these advantages is provided on a number of meshes with a wide range of size. With our mesh deformation solver, we also successfully demonstrate that visually appealing mesh animations can be generated from both motion capture data and a single base mesh even when they are inconsistent. Copyright © 2006 by the Association for Computing Machinery, Inc.
Persistent Identifierhttp://hdl.handle.net/10722/151888
ISSN
2015 Impact Factor: 4.218
2015 SCImago Journal Rankings: 2.552
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorShi, Len_US
dc.contributor.authorYu, Yen_US
dc.contributor.authorBell, Nen_US
dc.contributor.authorFeng, WWen_US
dc.date.accessioned2012-06-26T06:30:23Z-
dc.date.available2012-06-26T06:30:23Z-
dc.date.issued2006en_US
dc.identifier.citationACM Siggraph 2006 Papers (Siggraph '06) in ACM Transactions on Graphics, 2006, v. 25 n. 3, p. 1108-1117en_US
dc.identifier.issn0730-0301en_US
dc.identifier.urihttp://hdl.handle.net/10722/151888-
dc.description.abstractIn this paper, we present a multigrid technique for efficiently deforming large surface and volume meshes. We show that a previous least-squares formulation for distortion minimization reduces to a Laplacian system on a general graph structure for which we derive an analytic expression. We then describe an efficient multigrid algorithm for solving the relevant equations. Here we develop novel prolongation and restriction operators used in the multigrid cycles. Combined with a simple but effective graph coarsening strategy, our algorithm can outperform other multigrid solvers and the factorization stage of direct solvers in both time and memory costs for large meshes. It is demonstrated that our solver can trade off accuracy for speed to achieve greater interactivity, which is attractive for manipulating large meshes. Our multigrid solver is particularly well suited for a mesh editing environment which does not permit extensive precomputation. Experimental evidence of these advantages is provided on a number of meshes with a wide range of size. With our mesh deformation solver, we also successfully demonstrate that visually appealing mesh animations can be generated from both motion capture data and a single base mesh even when they are inconsistent. Copyright © 2006 by the Association for Computing Machinery, Inc.en_US
dc.languageengen_US
dc.relation.ispartofACM Transactions on Graphicsen_US
dc.subjectConstraintsen_US
dc.subjectGraph Hierarchyen_US
dc.subjectLaplacianen_US
dc.subjectMesh Editingen_US
dc.subjectProlongation/Restriction Operatorsen_US
dc.titleA fast multigrid algorithm for mesh deformationen_US
dc.typeConference_Paperen_US
dc.identifier.emailYu, Y:yzyu@cs.hku.hken_US
dc.identifier.authorityYu, Y=rp01415en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1145/1141911.1142001en_US
dc.identifier.scopuseid_2-s2.0-33749264241en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33749264241&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume25en_US
dc.identifier.issue3en_US
dc.identifier.spage1108en_US
dc.identifier.epage1117en_US
dc.identifier.isiWOS:000239817400074-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridShi, L=36168655800en_US
dc.identifier.scopusauthoridYu, Y=8554163500en_US
dc.identifier.scopusauthoridBell, N=14821905300en_US
dc.identifier.scopusauthoridFeng, WW=36960295400en_US
dc.customcontrol.immutablesml 151014 - merged-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats