1. Numerical solution of the Minkowski problem
- Author
-
Lars Lamberg and Mikko Kaasalainen
- Subjects
Applied Mathematics ,010102 general mathematics ,Minkowski's theorem ,Mathematical analysis ,Convex set ,Proper convex function ,Curvature function ,Subderivative ,Support function ,Mixed volume ,01 natural sciences ,Minkowski addition ,Computational Mathematics ,Newton's method ,0103 physical sciences ,Minkowski space ,0101 mathematics ,Spherical harmonics ,010303 astronomy & astrophysics ,Minkowski problem ,Mathematics - Abstract
We present a numerical procedure for solving the Minkowski problem, i.e., determining the convex set corresponding to a given curvature function. The method is based on Minkowski's isoperimetric inequality concerning convex and compact sets in R 3 . The support function of the target set is approximated in finite function space, so the problem becomes one of constrained optimization in R n , which in turn is solved by Newtonian (or other) iteration. We prove some properties of the optimization function and the constraining set and present some numerical examples.
- Published
- 2001
- Full Text
- View/download PDF