Large-scale bounded distortion mappings

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 optimizatio...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on graphics 2015-11, Vol.34 (6), p.1-10
Main Authors: Kovalsky, Shahar Z., Aigerman, Noam, Basri, Ronen, Lipman, Yaron
Format: Article
Language:English
Subjects:
Algorithms
Computational efficiency
Convergence
Differentials
Distortion
Optimization
Utilities
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0730-0301
1557-7368
DOI:10.1145/2816795.2818098