Generalized Koebe's method for conformal mapping multiply connected domains

W. Zeng, Xiaotian Yin, Min Zhang, F. Luo, X. Gu
{"title":"Generalized Koebe's method for conformal mapping multiply connected domains","authors":"W. Zeng, Xiaotian Yin, Min Zhang, F. Luo, X. Gu","doi":"10.1145/1629255.1629267","DOIUrl":null,"url":null,"abstract":"Surface parameterization refers to the process of mapping the surface to canonical planar domains, which plays crucial roles in texture mapping and shape analysis purposes. Most existing techniques focus on simply connected surfaces. It is a challenging problem for multiply connected genus zero surfaces. This work generalizes conventional Koebe's method for multiply connected planar domains. According to Koebe's uniformization theory, all genus zero multiply connected surfaces can be mapped to a planar disk with multiply circular holes. Furthermore, this kind of mappings are angle preserving and differ by Möbius transformations. We introduce a practical algorithm to explicitly construct such a circular conformal mapping. Our algorithm pipeline is as follows: suppose the input surface has n boundaries, first we choose 2 boundaries, and fill the other n -- 2 boundaries to get a topological annulus; then we apply discrete Yamabe flow method to conformally map the topological annulus to a planar annulus; then we remove the filled patches to get a planar multiply connected domain. We repeat this step for the planar domain iteratively. The two chosen boundaries differ from step to step. The iterative construction leads to the desired conformal mapping, such that all the boundaries are mapped to circles. In theory, this method converges quadratically faster than conventional Koebe's method. We give theoretic proof and estimation for the converging rate. In practice, it is much more robust and efficient than conventional non-linear methods based on curvature flow. Experimental results demonstrate the robustness and efficiency of the method.","PeriodicalId":216067,"journal":{"name":"Symposium on Solid and Physical Modeling","volume":"229 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Solid and Physical Modeling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1629255.1629267","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39

Abstract

Surface parameterization refers to the process of mapping the surface to canonical planar domains, which plays crucial roles in texture mapping and shape analysis purposes. Most existing techniques focus on simply connected surfaces. It is a challenging problem for multiply connected genus zero surfaces. This work generalizes conventional Koebe's method for multiply connected planar domains. According to Koebe's uniformization theory, all genus zero multiply connected surfaces can be mapped to a planar disk with multiply circular holes. Furthermore, this kind of mappings are angle preserving and differ by Möbius transformations. We introduce a practical algorithm to explicitly construct such a circular conformal mapping. Our algorithm pipeline is as follows: suppose the input surface has n boundaries, first we choose 2 boundaries, and fill the other n -- 2 boundaries to get a topological annulus; then we apply discrete Yamabe flow method to conformally map the topological annulus to a planar annulus; then we remove the filled patches to get a planar multiply connected domain. We repeat this step for the planar domain iteratively. The two chosen boundaries differ from step to step. The iterative construction leads to the desired conformal mapping, such that all the boundaries are mapped to circles. In theory, this method converges quadratically faster than conventional Koebe's method. We give theoretic proof and estimation for the converging rate. In practice, it is much more robust and efficient than conventional non-linear methods based on curvature flow. Experimental results demonstrate the robustness and efficiency of the method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
保角映射多连通域的广义Koebe方法
曲面参数化是指将曲面映射到标准平面域的过程,在纹理映射和形状分析中起着至关重要的作用。大多数现有技术都集中在单连通表面上。多连通属零曲面是一个具有挑战性的问题。本文对多连通平面域的Koebe方法进行了推广。根据Koebe的均匀化理论,所有的零属多重连通曲面都可以映射到具有多个圆孔的平面圆盘上。此外,这种映射是保角的,并且通过Möbius变换有所不同。我们介绍了一种实用的算法来显式构造这样一个圆共形映射。我们的算法流程如下:假设输入曲面有n个边界,首先选取2个边界,填充其余的n - 2个边界,得到一个拓扑环;然后应用离散Yamabe流方法将拓扑环空保形映射为平面环空;然后去除填充的小块,得到平面多连通域。对平面域迭代重复此步骤。这两个选择的边界每一步都不同。迭代构造导致所需的保角映射,这样所有的边界都映射到圆上。理论上,该方法的二次收敛速度比传统的Koebe方法快。给出了收敛速度的理论证明和估计。在实际应用中,该方法比传统的基于曲率流的非线性方法具有更高的鲁棒性和效率。实验结果证明了该方法的鲁棒性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Robust Minkowski sums of polyhedra via controlled linear perturbation Adaptive surface reconstruction based on implicit PHT-splines Hexahedral shell mesh construction via volumetric polycube map Hierarchical surface fairing with constraints Accurate moment computation using the GPU
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1