We propose an efficient algorithm for computing large-scale bounded distortion maps of triangular and tetrahedral meshes. Inspired by alternating optimization and Gauss-Newton approaches, our algorithm combines the computational efficiency of the former and the improved convergence properties of the latter.

Shahar Kovalsky, Weizmann Institute of Science
Noam Aigerman, Weizmann Institute of Science
Ronen Basri, Weizmann Institute of Science
Yaron Lipman, Weizmann Institute of Science