Large-scale bounded distortion mappings

Shahar Z. Kovalsky, Noam Aigerman, Ronen Basri, Yaron Lipman

Research output: Contribution to journalArticlepeer-review


We propose an efficient algorithm for computing large-scale bounded distortion maps of triangular and tetrahedral meshes. Specifically, given an initial map, we compute a similar map whose differentials are orientation preserving and have bounded condition number. Inspired by alternating optimization and Gauss-Newton approaches, we devise a first order method which combines the advantages of both. On the one hand, its iterations are as computationally efficient as those of alternating optimization. On the other hand, it enjoys preferable convergence properties, associated with Gauss-Newton like approaches. We demonstrate the utility of the proposed approach in efficiently solving geometry processing problems, focusing on challenging large-scale problems.

Original languageEnglish
Article number191
JournalACM Transactions on Graphics
Issue number6
Early online dateOct 2015
StatePublished - Nov 2015

All Science Journal Classification (ASJC) codes

  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Large-scale bounded distortion mappings'. Together they form a unique fingerprint.

Cite this