Conformal and quasi-conformal mappings have widespread applications in imaging science, computer vision and computer graphics, such as surface registration, segmentation, remeshing, and texture map compression. While various conformal and quasi-conformal parameterization methods for simply-connected surfaces have been proposed, efficient parameterization methods for multiply-connected surfaces are less explored. In this paper, we propose a novel parallelizable algorithm for computing the global conformal and quasi-conformal parameterization of multiply-connected surfaces onto a 2D circular domain using variants of the partial welding algorithm and the Koebe's iteration. The main idea is to partition a multiply-connected surface into several subdomains and compute the free-boundary conformal or quasi-conformal parameterizations of them respectively, and then apply a variant of the partial welding algorithm to reconstruct the global mapping. We apply the Koebe's iteration together with the geodesic algorithm to the boundary points and welding paths before and after the global welding to transform all the boundaries to circles conformally. After getting all the updated boundary conditions, we obtain the global parameterization of the multiply-connected surface by solving the Laplace equation for each subdomain. Using this divide-and-conquer approach, the parameterization of surfaces with very high resolution can be efficiently computed. Experimental results are presented to demonstrate the effectiveness of our proposed algorithms.
翻译:在成像科学、计算机视觉和计算机图象(如表面注册、分层、再模和纹理地图压缩等)中,复杂和准正规的绘图应用广泛。虽然提出了各种相连接表面的符合和准正规参数化方法,但对于多连接表面的高效参数化方法探索较少。在本文件中,我们提出了一个新的平行算法,用于利用部分焊接算法和Koebe的迭代法等变量,将多连接的表面分成几个子焦距,并分别对它们进行自由接连的或准非正规参数化,然后将部分焊接算法的变异法用于重建全球绘图。我们用Koebe的推算法和拟议成倍连接的倍连接表面参数一起计算出一个2D圆域,使用部分焊接算法的变异种,在全球焊接法之前和之后,将所有边界都转换成一个符合逻辑的圈。在获得所有更新的多连接的分界线质化法后,我们用每组的地平面算法来模拟地平面的平价化法,我们用平价化法的平价化法来展示这个高分辨率。