Numerical solution of the Minkowski problem
The problem alluded to in the title asks to determine a convex surface knowing its curvature. The author's approach is based on discretization: the support function of the target set is approximated by truncated spherical harmonic series. The original problem can be solved by means of one of several methods of constrained optimization in a finite dimensional real space. Details are given for numerical procedures based on Newton's method and the gradient method. Despite the fact that the convergence of the proposed method is not proved yet, numerical tests suggest it is robust and fast. NEWLINENEWLINENEWLINEAn interesting feature worth mentioning is the fact that the method works in practice for optimization of other objective functions.
- scientific article; zbMATH DE number 443067 (Why is no real title available?)
- scientific article; zbMATH DE number 3665740 (Why is no real title available?)
- scientific article; zbMATH DE number 3220189 (Why is no real title available?)
- The Weyl and Minkowski problems in differential geometry in the large
- Construction of shapes arising from the Minkowski problem using a level set approach
- scientific article; zbMATH DE number 5982333 (Why is no real title available?)
- On the Orlicz Minkowski problem for polytopes
- Solution to the inverse Wulff problem by means of the enhanced semidefinite relaxation method
- Numerical methods of interpolation for the solution of some problems of the convex geometry in Lobachevsky's space
- Reconstruction problems of convex bodies from surface area measures and lightness functions
- Operator-splitting/finite element methods for the Minkowski problem
- Reconstruction problems of convex bodies from even L_p surface area measures
- Applications of new affine invariant for polytopes
This page was built for publication: Numerical solution of the Minkowski problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953928)