Large mesh deformation using the volumetric graph Laplacian

Kun Zhou, Jin Huang, John M. Snyder, Xinguo Liu, H. Bao, B. Guo, H. Shum
{"title":"Large mesh deformation using the volumetric graph Laplacian","authors":"Kun Zhou, Jin Huang, John M. Snyder, Xinguo Liu, H. Bao, B. Guo, H. Shum","doi":"10.1145/1186822.1073219","DOIUrl":null,"url":null,"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.","PeriodicalId":211118,"journal":{"name":"ACM SIGGRAPH 2005 Papers","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2005-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"356","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGGRAPH 2005 Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1186822.1073219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 356

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.
大网格变形采用拉普拉斯体积图
我们提出了一种使用体积图拉普拉斯的三维网格大变形的新技术。我们首先构造一个图来表示输入网格内的体积。图不需要形成输入网格内部的实体网格;它的边缘简单地连接了邻近的点。这个图的拉普拉斯函数将体积细节编码为图中每个点与其相邻点的平均值之间的差。在变形期间保留这些体积细节施加了体积约束,以防止体积的不自然变化。我们还在图中包含网格外的短距离点,以避免局部自相交。体积细节保存用二次能量函数表示。最小化它在最小二乘意义上保留细节,在整个变形网格上均匀分布误差。它也可以与涉及表面位置,细节或平滑的传统约束相结合,并通过求解稀疏线性系统有效地最小化。我们将此技术应用于基于二维曲线的变形系统中,允许新手用户轻松创建令人愉悦的变形。该系统的一个新颖应用是将二维卡通人物的非刚性和夸张变形应用到三维网格中。我们用几个例子来展示我们的系统的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信