Implicit Minimal Surfaces for Bijective Correspondences

IF 13 1区 计算机科学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Etienne Corman, Yousuf Soliman, Robin Magnet, Mark Gillespie
{"title":"Implicit Minimal Surfaces for Bijective Correspondences","authors":"Etienne Corman, Yousuf Soliman, Robin Magnet, Mark Gillespie","doi":"10.1145/3811368","DOIUrl":null,"url":null,"abstract":"We introduce an <jats:italic toggle=\"yes\">implicit</jats:italic> representation of continuous, bijective, orientation-preserving maps between genus zero surfaces with or without boundary. The distortion of these maps can easily be minimized by optimizing the Ginzburg-Landau functional—a ubiquitous model in physics and differential geometry—leading to a simple algorithm for computing bijective correspondences using only standard tools of the tangent vector field toolbox. The method avoids combinatorial mesh modifications and does not require barrier functions to enforce bijectivity making it more robust to noise and simpler to implement. Moreover, the algorithm does not assume a bijective initialization and can untangle non-bijective correspondences generated by computationally cheaper methods such as functional maps. It supports the use of both landmark points and landmark curves to guide the correspondence. The key idea is that a bijection between surfaces defines a two-dimensional mapping surface sitting inside the four-dimensional product space of the two inputs, and this mapping surface can be stored implicitly as the zero set of a <jats:italic toggle=\"yes\">complex section</jats:italic> —essentially a complex function defined on the product space. Now the distortion of the map can be optimized by minimizing the area of this mapping surface, which amounts to minimizing the Ginzburg-Landau functional of the complex section. We demonstrate the practical benefits of our method by comparing to state-of-the-art correspondence algorithms and show that our implicit representation offers improved stability and naturally supports constraints that are difficult to enforce with explicit map representations.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"32 1","pages":""},"PeriodicalIF":13.0000,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Graphics","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3811368","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

We introduce an implicit representation of continuous, bijective, orientation-preserving maps between genus zero surfaces with or without boundary. The distortion of these maps can easily be minimized by optimizing the Ginzburg-Landau functional—a ubiquitous model in physics and differential geometry—leading to a simple algorithm for computing bijective correspondences using only standard tools of the tangent vector field toolbox. The method avoids combinatorial mesh modifications and does not require barrier functions to enforce bijectivity making it more robust to noise and simpler to implement. Moreover, the algorithm does not assume a bijective initialization and can untangle non-bijective correspondences generated by computationally cheaper methods such as functional maps. It supports the use of both landmark points and landmark curves to guide the correspondence. The key idea is that a bijection between surfaces defines a two-dimensional mapping surface sitting inside the four-dimensional product space of the two inputs, and this mapping surface can be stored implicitly as the zero set of a complex section —essentially a complex function defined on the product space. Now the distortion of the map can be optimized by minimizing the area of this mapping surface, which amounts to minimizing the Ginzburg-Landau functional of the complex section. We demonstrate the practical benefits of our method by comparing to state-of-the-art correspondence algorithms and show that our implicit representation offers improved stability and naturally supports constraints that are difficult to enforce with explicit map representations.
双射对应的隐极小曲面
我们引入了有边界或无边界的属零曲面之间的连续、双射、保向映射的隐式表示。通过优化金兹堡-朗道函数(一个在物理学和微分几何中普遍存在的模型),这些映射的失真可以很容易地最小化,从而产生一个简单的算法来计算双射对应,仅使用切向量场工具箱的标准工具。该方法避免了组合网格修改,并且不需要屏障函数来增强客观性,使其对噪声的鲁棒性更强,实现更简单。此外,该算法不假设双目标初始化,并且可以解算由函数映射等计算成本更低的方法生成的非双目标对应。它支持使用地标点和地标曲线来指导对应。关键思想是曲面之间的双射定义了位于两个输入的四维积空间内的二维映射曲面,并且该映射曲面可以隐式地存储为复截面的零集-本质上是在积空间上定义的复函数。现在,可以通过最小化该映射曲面的面积来优化地图的变形,这相当于最小化复杂截面的金兹堡-朗道函数。通过与最先进的通信算法进行比较,我们展示了我们的方法的实际优势,并表明我们的隐式表示提供了更好的稳定性,并且自然地支持难以通过显式映射表示强制执行的约束。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
ACM Transactions on Graphics
ACM Transactions on Graphics 工程技术-计算机:软件工程
CiteScore
14.30
自引率
25.80%
发文量
193
审稿时长
12 months
期刊介绍: ACM Transactions on Graphics (TOG) is a peer-reviewed scientific journal that aims to disseminate the latest findings of note in the field of computer graphics. It has been published since 1982 by the Association for Computing Machinery. Starting in 2003, all papers accepted for presentation at the annual SIGGRAPH conference are printed in a special summer issue of the journal.
×
引用
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学术官方微信
小红书