Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps

Janine Bennett, Valerio Pascucci, K. Joy
{"title":"Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps","authors":"Janine Bennett, Valerio Pascucci, K. Joy","doi":"10.1109/PG.2007.42","DOIUrl":null,"url":null,"abstract":"We consider the problem of generating a map between two triangulated meshes, M and M', with arbitrary and possibly differing genus. This problem has rarely been tackled in its generality. Early schemes considered only topological spheres. Recent algorithms allow inputs with an arbitrary number of tunnels but require M and M' to have equal genus, mapping tunnel to tunnel. Other schemes which allow more general inputs are not guaranteed to work and the authors do not provide a characterization of the input meshes that can be processed successfully. Moreover, the techniques have difficulty dealing with coarse meshes with many tunnels. In this paper we present the first robust approach to build a map between two meshes of arbitrary unequal genus. We also provide a simplified method for setting the initial alignment between M and M', reducing reliance on landmarks and allowing the user to select \"landmark tunnels\" in addition to the standard landmark vertices. After computing the map, we automatically derive a continuous deformation from M to M' using a variational implicit approach to describe the evolution of non-landmark tunnels. Overall, we achieve a cross parameterization scheme that is provably robust in the sense that it can mapM toM' without constraints on their relative genus or on the density of the triangulation with respect to the number of tunnels. To demonstrate the practical effectiveness of our scheme we provide a number of examples of inter-surface parameterizations between meshes of different genus and shape.","PeriodicalId":376934,"journal":{"name":"15th Pacific Conference on Computer Graphics and Applications (PG'07)","volume":"1987 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"15th Pacific Conference on Computer Graphics and Applications (PG'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PG.2007.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

We consider the problem of generating a map between two triangulated meshes, M and M', with arbitrary and possibly differing genus. This problem has rarely been tackled in its generality. Early schemes considered only topological spheres. Recent algorithms allow inputs with an arbitrary number of tunnels but require M and M' to have equal genus, mapping tunnel to tunnel. Other schemes which allow more general inputs are not guaranteed to work and the authors do not provide a characterization of the input meshes that can be processed successfully. Moreover, the techniques have difficulty dealing with coarse meshes with many tunnels. In this paper we present the first robust approach to build a map between two meshes of arbitrary unequal genus. We also provide a simplified method for setting the initial alignment between M and M', reducing reliance on landmarks and allowing the user to select "landmark tunnels" in addition to the standard landmark vertices. After computing the map, we automatically derive a continuous deformation from M to M' using a variational implicit approach to describe the evolution of non-landmark tunnels. Overall, we achieve a cross parameterization scheme that is provably robust in the sense that it can mapM toM' without constraints on their relative genus or on the density of the triangulation with respect to the number of tunnels. To demonstrate the practical effectiveness of our scheme we provide a number of examples of inter-surface parameterizations between meshes of different genus and shape.
属无关交叉参数化:曲面间映射的鲁棒拓扑管理
我们考虑在两个三角形网格M和M'之间生成映射的问题,它们具有任意和可能不同的属。这个问题很少被笼统地处理。早期的方案只考虑拓扑球。最近的算法允许输入任意数量的隧道,但要求M和M'具有相等的属,将隧道映射到隧道。其他允许更一般输入的方案不能保证工作,作者也没有提供可以成功处理的输入网格的特征。此外,该技术在处理具有许多隧道的粗糙网格时存在困难。在本文中,我们提出了在任意不等属的两个网格之间建立映射的第一个鲁棒方法。我们还提供了一种简化的方法来设置M和M'之间的初始对齐,减少了对地标的依赖,并允许用户在标准地标顶点之外选择“地标隧道”。在计算地图后,我们使用变分隐式方法自动导出M到M'的连续变形来描述非地标隧道的演变。总的来说,我们实现了一种交叉参数化方案,它可以在不受它们的相对属或三角剖分密度相对于隧道数量的约束的情况下映射toM',因此可以证明它是鲁棒的。为了证明该方案的实际有效性,我们提供了许多不同种类和形状的网格之间的表面间参数化的例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信