Numerical solution of the Minkowski problem

10Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

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 R3. The support function of the target set is approximated in finite function space, so the problem becomes one of constrained optimization in Rn, 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. © 2001 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Lamberg, L., & Kaasalainen, M. (2001). Numerical solution of the Minkowski problem. Journal of Computational and Applied Mathematics, 137(2), 213–227. https://doi.org/10.1016/S0377-0427(01)00360-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free