Conformal Mapping with as Uniform as Possible Conformal Factor

According to the uniformization theorem, any surface can be conformally mapped into a domain of a constant Gaussian curvature. The conformal factor indicates the local scaling introduced by such a mapping. This process could be used to compute geometric quantities in a simplified flat domain with zero Gaussian curvature. For example, the computation of geodesic distances on a curved surface can be mapped into solving an eikonal equation in a plane weighted by the conformal factor. Solving an eikonal equation on the weighted plane can then be done by regular sampling of the domain using, for example, the celebrated fast marching method (FMM). The connection between the conformal factor on the plane and the surface geometry can be justified analytically. Still, in order to construct consistent numerical solvers that exploit this relation, one needs to prove that the conformal factor is bounded. We provide theoretical bounds of the conformal factor and introduce optimization formulations that control its beh...

[1]  Steven J. Gortler,et al.  Fast exact and approximate geodesics on meshes , 2005, ACM Trans. Graph..

[2]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[3]  Alexander M. Bronstein,et al.  Weighted distance maps computation on parametric three-dimensional manifolds , 2007, J. Comput. Phys..

[4]  I. Daubechies,et al.  Conformal Wasserstein distances: Comparing surfaces in polynomial time , 2011, 1103.4408.

[5]  Gabriel Peyré,et al.  Derivatives with respect to metrics and applications: subgradient marching algorithm , 2010, Numerische Mathematik.

[6]  F. Mémoli,et al.  Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces: 730 , 2001 .

[7]  Paul M. Thompson,et al.  Genus zero surface conformal mapping and its application to brain surface mapping , 2004, IEEE Transactions on Medical Imaging.

[8]  Ron Kimmel,et al.  Optimal Algorithm for Shape from Shading and Path Planning , 2001, Journal of Mathematical Imaging and Vision.

[9]  Thomas A. Funkhouser,et al.  Möbius voting for surface correspondence , 2009, ACM Trans. Graph..

[10]  Michael Zibulevsky,et al.  Penalty/Barrier Multiplier Methods for Convex Programming Problems , 1997, SIAM J. Optim..

[11]  I. Daubechies,et al.  Surface Comparison with Mass Transportation , 2009, 0912.3488.

[12]  Eric L. Schwartz,et al.  Conformal image warping , 2018, IEEE Computer Graphics and Applications.

[13]  Wei Zeng,et al.  Ricci Flow for 3D Shape Analysis , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[14]  R. Kimmel,et al.  An efficient solution to the eikonal equation on parametric manifolds , 2004 .

[15]  Ron Kimmel,et al.  Fast Marching Methods , 2004 .

[16]  Yalin Wang,et al.  Optimal global conformal surface parameterization , 2004, IEEE Visualization 2004.

[17]  Alexander M. Bronstein,et al.  Parallel algorithms for approximation of distance maps on parametric surfaces , 2008, TOGS.

[18]  Ron Kimmel,et al.  Numerical geometry of images - theory, algorithms, and applications , 2003 .

[19]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Alexander M. Bronstein,et al.  On reconstruction of non-rigid shapes with intrinsic regularization , 2009, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops.

[21]  E. Rouy,et al.  A viscosity solutions approach to shape-from-shading , 1992 .

[22]  Lok Ming Lui,et al.  Computing quasiconformal maps using an auxiliary metric and discrete curvature flow , 2012, Numerische Mathematik.

[23]  Alexander M. Bronstein,et al.  Numerical Geometry of Non-Rigid Shapes , 2009, Monographs in Computer Science.