暂无分享,去创建一个
An algorithm for the computation of global discrete conformal parametrizations with prescribed global holonomy signatures for triangle meshes was recently described in [Campen and Zorin 2017]. In this paper we provide a detailed analysis of convergence and correctness of this algorithm. We generalize and extend ideas of [Springborn et al. 2008] to show a connection of the algorithm to Newton's algorithm applied to solving the system of constraints on angles in the parametric domain, and demonstrate that this system can be obtained as a gradient of a convex energy.
[1] ZorinDenis,et al. Similarity maps and field-guided T-splines , 2017 .
[2] P. Schröder,et al. Conformal equivalence of triangle meshes , 2008, SIGGRAPH 2008.
[3] Feng Luo. COMBINATORIAL YAMABE FLOW ON SURFACES , 2003 .
[4] Keenan Crane,et al. Trivial Connections on Discrete Surfaces , 2010, Comput. Graph. Forum.
[5] Marcel Campen,et al. Similarity maps and field-guided T-splines , 2017, ACM Trans. Graph..