The Inverse Moment Problem for Convex Polytopes

31Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a general and novel approach for the reconstruction of any convex d-dimensional polytope P, assuming knowledge of finitely many of its integral moments. In particular, we show that the vertices of an N-vertex convex polytope in ℝ d can be reconstructed from the knowledge of O(DN) axial moments (w. r. t. to an unknown polynomial measure of degree D), in d+1 distinct directions in general position. Our approach is based on the collection of moment formulas due to Brion, Lawrence, Khovanskii-Pukhlikov, and Barvinok that arise in the discrete geometry of polytopes, combined with what is variously known as Prony's method, or the Vandermonde factorization of finite rank Hankel matrices. © 2012 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Gravin, N., Lasserre, J., Pasechnik, D. V., & Robins, S. (2012). The Inverse Moment Problem for Convex Polytopes. Discrete and Computational Geometry, 48(3), 596–621. https://doi.org/10.1007/s00454-012-9426-4

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