How close is a quad mesh to a polycube?

IF 0.4 4区 计算机科学 Q4 MATHEMATICS
Markus Baumeister, Leif Kobbelt
{"title":"How close is a quad mesh to a polycube?","authors":"Markus Baumeister,&nbsp;Leif Kobbelt","doi":"10.1016/j.comgeo.2022.101978","DOIUrl":null,"url":null,"abstract":"<div><p>We compute the shortest sequence of local connectivity modifications that transform a genus 0 quad mesh to a polycube. The modification operations are (dual) loop preserving and thus, we are restricted to quad meshes where loops don't self-intersect and two loops intersect at most twice. The intersection patterns of the loops are encoded in a simplicial complex, which we call loop complex. To formulate the modification search over the loop complex, we characterise polycubes combinatorially and determine dependencies between modifications. We show that the full task can be encoded as a mixed-integer problem that is solved by a commodity MIP-solver. We demonstrate the practical feasibility by a number of examples with varying complexity.</p></div>","PeriodicalId":51001,"journal":{"name":"Computational Geometry-Theory and Applications","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Geometry-Theory and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925772122001213","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We compute the shortest sequence of local connectivity modifications that transform a genus 0 quad mesh to a polycube. The modification operations are (dual) loop preserving and thus, we are restricted to quad meshes where loops don't self-intersect and two loops intersect at most twice. The intersection patterns of the loops are encoded in a simplicial complex, which we call loop complex. To formulate the modification search over the loop complex, we characterise polycubes combinatorially and determine dependencies between modifications. We show that the full task can be encoded as a mixed-integer problem that is solved by a commodity MIP-solver. We demonstrate the practical feasibility by a number of examples with varying complexity.

四边形网格与多边形网格的距离有多近?
我们计算局部连通性修改的最短序列,该序列将亏格0四元网格转换为多立方体。修改操作是(双重)循环保留的,因此,我们被限制为四元网格,其中循环不自相交,两个循环最多相交两次。循环的交集模式被编码在一个单纯复形中,我们称之为循环复形。为了公式化环复形上的修改搜索,我们组合地刻画了多边形,并确定了修改之间的依赖关系。我们证明了整个任务可以编码为混合整数问题,该问题由商品MIP求解器解决。我们通过一些不同复杂度的例子来证明实际的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.60
自引率
16.70%
发文量
43
审稿时长
>12 weeks
期刊介绍: Computational Geometry is a forum for research in theoretical and applied aspects of computational geometry. The journal publishes fundamental research in all areas of the subject, as well as disseminating information on the applications, techniques, and use of computational geometry. Computational Geometry publishes articles on the design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects. Also welcomed are computational geometry solutions to fundamental problems arising in computer graphics, pattern recognition, robotics, image processing, CAD-CAM, VLSI design and geographical information systems. Computational Geometry features a special section containing open problems and concise reports on implementations of computational geometry tools.
×
引用
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学术官方微信