基于拉普拉斯坐标和梯度的交互式网格切割

Bin Liu, Weiming M. Wang, Junjie Cao, Xiuping Liu
{"title":"基于拉普拉斯坐标和梯度的交互式网格切割","authors":"Bin Liu, Weiming M. Wang, Junjie Cao, Xiuping Liu","doi":"10.4310/CIS.2017.V17.N2.A1","DOIUrl":null,"url":null,"abstract":"Sketch-based mesh cutting has been attended by researchers in Computer Graphics, mainly due to its success in dealing with semantic information of mesh with little user interaction. Although most existing approaches have gained great improvement, they depend on the predefined geometric features sensitive to shape and complex mathematical theory, and most methods can not generate a global unique solution for the segmentation problem. In this paper, we propose a novel sketch-based mesh segmentation model with Laplace Coordinates and gradient, which is independent of the complex geometric features and could perceive the differences of mesh parts. Furthermore, our algorithm is easy to implement, mathematically simple, and a global unique solution can be guaranteed because of our convex quadratic model. Benefiting from the Laplace Coordinates and gradient, our method holds an anisotropic behavior and can better fit the cutting boundary. Namely, triangular faces sharing similar attributes are kept closer to each other while big jumps naturally happen on the boundary between mesh parts when our method is applied. A large number of experiments illustrate the enhanced efficacy of our method compared with the state-of-the-art techniques.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Interactive mesh cutting with Laplace coordinates and gradient\",\"authors\":\"Bin Liu, Weiming M. Wang, Junjie Cao, Xiuping Liu\",\"doi\":\"10.4310/CIS.2017.V17.N2.A1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sketch-based mesh cutting has been attended by researchers in Computer Graphics, mainly due to its success in dealing with semantic information of mesh with little user interaction. Although most existing approaches have gained great improvement, they depend on the predefined geometric features sensitive to shape and complex mathematical theory, and most methods can not generate a global unique solution for the segmentation problem. In this paper, we propose a novel sketch-based mesh segmentation model with Laplace Coordinates and gradient, which is independent of the complex geometric features and could perceive the differences of mesh parts. Furthermore, our algorithm is easy to implement, mathematically simple, and a global unique solution can be guaranteed because of our convex quadratic model. Benefiting from the Laplace Coordinates and gradient, our method holds an anisotropic behavior and can better fit the cutting boundary. Namely, triangular faces sharing similar attributes are kept closer to each other while big jumps naturally happen on the boundary between mesh parts when our method is applied. A large number of experiments illustrate the enhanced efficacy of our method compared with the state-of-the-art techniques.\",\"PeriodicalId\":185710,\"journal\":{\"name\":\"Commun. Inf. Syst.\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Commun. Inf. Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4310/CIS.2017.V17.N2.A1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Commun. Inf. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4310/CIS.2017.V17.N2.A1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

基于草图的网格切割在计算机图形学领域一直受到研究人员的关注,主要是因为它能够在用户交互较少的情况下处理网格的语义信息。现有的分割方法虽然取得了很大的进步,但它们依赖于预定义的形状敏感的几何特征和复杂的数学理论,大多数方法不能生成分割问题的全局唯一解。本文提出了一种基于拉普拉斯坐标和梯度的基于草图的网格分割模型,该模型不依赖于复杂的几何特征,能够感知网格部分的差异。此外,我们的算法易于实现,数学上简单,并且由于我们的凸二次模型可以保证全局唯一解。利用拉普拉斯坐标和梯度,该方法具有各向异性,能较好地拟合切割边界。即,具有相似属性的三角形面彼此保持更近的距离,而当应用我们的方法时,网格部分之间的边界自然会发生大的跳跃。大量的实验表明,与最先进的技术相比,我们的方法更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interactive mesh cutting with Laplace coordinates and gradient
Sketch-based mesh cutting has been attended by researchers in Computer Graphics, mainly due to its success in dealing with semantic information of mesh with little user interaction. Although most existing approaches have gained great improvement, they depend on the predefined geometric features sensitive to shape and complex mathematical theory, and most methods can not generate a global unique solution for the segmentation problem. In this paper, we propose a novel sketch-based mesh segmentation model with Laplace Coordinates and gradient, which is independent of the complex geometric features and could perceive the differences of mesh parts. Furthermore, our algorithm is easy to implement, mathematically simple, and a global unique solution can be guaranteed because of our convex quadratic model. Benefiting from the Laplace Coordinates and gradient, our method holds an anisotropic behavior and can better fit the cutting boundary. Namely, triangular faces sharing similar attributes are kept closer to each other while big jumps naturally happen on the boundary between mesh parts when our method is applied. A large number of experiments illustrate the enhanced efficacy of our method compared with the state-of-the-art techniques.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信