Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2816795.2818098 | ACM Transactions on Graphics |
Keywords | Field | DocType |
optimization,first order methods,bounded conformal distortion,bounded distortion mappings,simplicial meshes | Convergence (routing),Differential (mechanical device),Condition number,Mathematical optimization,Tetrahedral meshes,First order,Geometry processing,Computer science,Distortion,Bounded function | Journal |
Volume | Issue | ISSN |
34 | 6 | 0730-0301 |
Citations | PageRank | References |
20 | 0.66 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shahar Z. Kovalsky | 1 | 192 | 10.87 |
| Noam Aigerman | 2 | 215 | 12.60 |
| Ronen Basri | 3 | 3467 | 403.18 |
| Yaron Lipman | 4 | 1687 | 67.52 |