On Discrete Conformal Seamless Similarity Maps
M. Campen, D. Zorin, ArXiv:1705.02422 (2017).
Download
No fulltext has been uploaded.
Preprint
| English
Author
Campen, MarcelLibreCat 
;
Zorin, Denis
;
Zorin, DenisDepartment
Abstract
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.
Publishing Year
Journal Title
arXiv:1705.02422
LibreCat-ID
Cite this
Campen M, Zorin D. On Discrete Conformal Seamless Similarity Maps. arXiv:170502422. Published online 2017.
Campen, M., & Zorin, D. (2017). On Discrete Conformal Seamless Similarity Maps. In arXiv:1705.02422.
@article{Campen_Zorin_2017, title={On Discrete Conformal Seamless Similarity Maps}, journal={arXiv:1705.02422}, author={Campen, Marcel and Zorin, Denis}, year={2017} }
Campen, Marcel, and Denis Zorin. “On Discrete Conformal Seamless Similarity Maps.” ArXiv:1705.02422, 2017.
M. Campen and D. Zorin, “On Discrete Conformal Seamless Similarity Maps,” arXiv:1705.02422. 2017.
Campen, Marcel, and Denis Zorin. “On Discrete Conformal Seamless Similarity Maps.” ArXiv:1705.02422, 2017.
arXiv 
Google Scholar