A minimization approach for constructing generalized barycentric coordinates and its computation

DOI10.1007/S10915-020-01267-0MaRDI QIDQ777032zbMATH OpenOpenAlexFDO

Authors Chongyang Deng, Xiali Fan, Ming-Jun Lai

Publication date 13 July 2020

Published in Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10915-020-01267-0

zbMATH Keywords

generalized barycentric coordinatesmeshimage deformationalternative projection algorithmbiharmonic GBCcartoon

Mathematics Subject Classification ID

General theory for ordinary differential equations (34Axx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Cites work

• scientific article; zbMATH DE number 1181255 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A polygonal spline method for general second-order elliptic equations and its applications
• A rational finite element basis
• Barycentric coordinates and their properties
• Best approximation in inner product spaces
• Conforming polygonal finite elements
• Construction of polygonal interpolants: a maximum entropy approach
• Error bounds for minimal energy bivariate polynomial splines
• Generalized barycentric coordinates and applications
• Generalized barycentric coordinates in computer graphics and computational mechanics
• Introductory lectures on convex optimization. A basic course.
• Local barycentric coordinates
• New perspectives on polygonal and polyhedral finite element methods
• On the approximation power of bivariate splines
• Parallel multi-block ADMM with \(o(1/k)\) convergence
• Polygonal spline spaces and the numerical solution of the Poisson equation
• Quadratic serendipity finite elements on polygons using generalized barycentric coordinates
• Spline Functions on Triangulations
• The multivariate spline mehtod for scattered data fitting and numerical solution of partial differential equations
• The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\)

Cited in

(1)

• A column generation approach to the discrete barycenter problem

This page was built for publication: A minimization approach for constructing generalized barycentric coordinates and its computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777032)