2017
DOI: 10.1111/cgf.13243
|View full text |Cite
|
Sign up to set email alerts
|

Isometry‐Aware Preconditioning for Mesh Parameterization

Abstract: This paper presents a new preconditioning technique for large‐scale geometric optimization problems, inspired by applications in mesh parameterization. Our positive (semi‐)definite preconditioner acts on the gradients of optimization problems whose variables are positions of the vertices of a triangle mesh in ℝ2 or of a tetrahedral mesh in ℝ3, converting localized distortion gradients into the velocity of a globally near‐rigid motion via a linear solve. We pose our preconditioning tool in terms of the Killing … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
41
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 53 publications
(41 citation statements)
references
References 52 publications
0
41
0
Order By: Relevance
“…Other distortion energies were addressed using block coordinate descent methods (Fu et al 2015;Horman and Greiner 1999) and Gauss-Newton solvers (Eigensatz and Pauly 2009). More recently, Kovalsky et al (2016) showed that the Laplacian matrix is a reliable quadratic proxy for many distortion energies, while Claici et al (2017) advocated the discrete Killing operator as an isometry-aware proxy. Alternatively, Rabinovich et al (2017) proposed an iterative reweighting scheme of the Laplacian based on gradient residuals.…”
Section: First-order Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Other distortion energies were addressed using block coordinate descent methods (Fu et al 2015;Horman and Greiner 1999) and Gauss-Newton solvers (Eigensatz and Pauly 2009). More recently, Kovalsky et al (2016) showed that the Laplacian matrix is a reliable quadratic proxy for many distortion energies, while Claici et al (2017) advocated the discrete Killing operator as an isometry-aware proxy. Alternatively, Rabinovich et al (2017) proposed an iterative reweighting scheme of the Laplacian based on gradient residuals.…”
Section: First-order Methodsmentioning
confidence: 99%
“…To overcome this issue, many strategies have been developed for modifying the Hessian matrix using a variety of convex proxies. For instance, some techniques replace the Hessian with a Laplacianlike preconditioning matrix at the cost of degrading convergence to first-order (Claici et al 2017;Kovalsky et al 2016). Other methods alter the Hessian by removing negative eigenvalues numerically (Stomakhin et al 2012;Teran et al 2005) or via 2D composite majorization (Shtengel et al 2017).…”
Section: Introductionmentioning
confidence: 99%
“…[2017] proposed a scalable approach to compute locally injective mappings, via local-global minimization of a reweighted proxy function. Claici et al [2017] proposed a preconditioner for fast minimization of distortion energies. Shtengel et al [2017] applied the idea of majorizationminimization [Lange 2004] to iteratively update and minimize a convex majorizer of the target energy in geometric optimization.…”
Section: Related Workmentioning
confidence: 99%
“…These non-linear energies are difficult to minimize, stemming a series of methods specifically targeting this problem. They include coordinate descent Labsik et al 2000], parallel gradient descent [Fu et al 2015], Anderson Acceleration [Peng et al 2018], as well as other quasi-newton approaches [Claici et al 2017;• 32:3 Kovalsky et al 2016;Rabinovich et al 2017;Shtengel et al 2017;Smith and Schaefer 2015;Zhu et al 2018].…”
Section: Distortion-minimizing Mappingsmentioning
confidence: 99%